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-8-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:53:32,674 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:53:32,676 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:53:32,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:53:32,688 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:53:32,689 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:53:32,690 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:53:32,692 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:53:32,693 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:53:32,694 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:53:32,695 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:53:32,695 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:53:32,696 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:53:32,697 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:53:32,698 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:53:32,699 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:53:32,700 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:53:32,702 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:53:32,704 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:53:32,706 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:53:32,707 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:53:32,708 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:53:32,710 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:53:32,711 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:53:32,711 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:53:32,712 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:53:32,713 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:53:32,714 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:53:32,714 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:53:32,715 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:53:32,716 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:53:32,716 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:53:32,717 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:53:32,717 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:53:32,718 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:53:32,718 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:53:32,719 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-25 15:53:32,733 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:53:32,734 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:53:32,734 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:53:32,735 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:53:32,735 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:53:32,735 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:53:32,735 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:53:32,735 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:53:32,736 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:53:32,736 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:53:32,736 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:53:32,736 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:53:32,736 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:53:32,737 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:53:32,737 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:53:32,737 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:53:32,738 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:53:32,738 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:53:32,738 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:53:32,738 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:53:32,738 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:53:32,739 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:53:32,739 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:53:32,739 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:53:32,739 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:53:32,739 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:53:32,740 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:53:32,740 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:53:32,740 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:53:32,740 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:53:32,740 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:53:32,741 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:53:32,741 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:53:32,741 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:53:32,741 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:53:32,741 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:53:32,741 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:53:32,742 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:53:32,742 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:53:32,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:53:32,799 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:53:32,802 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:53:32,803 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:53:32,804 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:53:32,805 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-unlimited.bpl [2019-02-25 15:53:32,805 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-unlimited.bpl' [2019-02-25 15:53:32,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:53:32,844 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:53:32,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:53:32,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:53:32,845 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:53:32,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:53:32" (1/1) ... [2019-02-25 15:53:32,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:53:32" (1/1) ... [2019-02-25 15:53:32,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:53:32,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:53:32,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:53:32,901 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:53:32,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:53:32" (1/1) ... [2019-02-25 15:53:32,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:53:32" (1/1) ... [2019-02-25 15:53:32,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:53:32" (1/1) ... [2019-02-25 15:53:32,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:53:32" (1/1) ... [2019-02-25 15:53:32,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:53:32" (1/1) ... [2019-02-25 15:53:32,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:53:32" (1/1) ... [2019-02-25 15:53:32,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:53:32" (1/1) ... [2019-02-25 15:53:32,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:53:32,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:53:32,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:53:32,928 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:53:32,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:53:32" (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-25 15:53:33,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:53:33,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:53:33,490 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:53:33,490 INFO L286 CfgBuilder]: Removed 19 assue(true) statements. [2019-02-25 15:53:33,491 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:53:33 BoogieIcfgContainer [2019-02-25 15:53:33,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:53:33,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:53:33,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:53:33,496 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:53:33,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:53:32" (1/2) ... [2019-02-25 15:53:33,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1a6364 and model type speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:53:33, skipping insertion in model container [2019-02-25 15:53:33,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:53:33" (2/2) ... [2019-02-25 15:53:33,499 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-8-unlimited.bpl [2019-02-25 15:53:33,508 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:53:33,515 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-02-25 15:53:33,532 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-02-25 15:53:33,570 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:53:33,570 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:53:33,570 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:53:33,570 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:53:33,570 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:53:33,571 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:53:33,571 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:53:33,571 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:53:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-02-25 15:53:33,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-25 15:53:33,589 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:33,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-25 15:53:33,593 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:33,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:33,599 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-02-25 15:53:33,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:33,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:33,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:33,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:33,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:33,837 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-25 15:53:33,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:53:33,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:53:33,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:53:33,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:53:33,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:53:33,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:53:33,856 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-02-25 15:53:34,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:34,105 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-02-25 15:53:34,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:53:34,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-25 15:53:34,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:34,126 INFO L225 Difference]: With dead ends: 37 [2019-02-25 15:53:34,126 INFO L226 Difference]: Without dead ends: 32 [2019-02-25 15:53:34,132 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-25 15:53:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-25 15:53:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2019-02-25 15:53:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-25 15:53:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2019-02-25 15:53:34,163 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 2 [2019-02-25 15:53:34,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:34,164 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2019-02-25 15:53:34,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:53:34,164 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2019-02-25 15:53:34,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:53:34,165 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:34,165 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:53:34,166 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:34,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:34,166 INFO L82 PathProgramCache]: Analyzing trace with hash 30818, now seen corresponding path program 1 times [2019-02-25 15:53:34,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:34,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:34,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:34,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:34,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:34,347 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-25 15:53:34,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:34,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:34,348 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:53:34,350 INFO L207 CegarAbsIntRunner]: [0], [32], [35] [2019-02-25 15:53:34,405 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:34,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:38,171 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:38,173 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-25 15:53:38,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:38,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:38,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:38,181 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-25 15:53:38,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:38,197 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:38,224 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:53:38,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:38,294 INFO L467 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 27 treesize of output 30 [2019-02-25 15:53:38,339 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,341 INFO L467 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 30 treesize of output 36 [2019-02-25 15:53:38,379 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,404 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,405 INFO L467 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 32 treesize of output 46 [2019-02-25 15:53:38,452 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,476 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,498 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,500 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:53:38,551 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,575 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,598 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,623 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,624 INFO L292 Elim1Store]: Index analysis took 116 ms [2019-02-25 15:53:38,625 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:53:38,655 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,678 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,705 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,737 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,738 INFO L292 Elim1Store]: Index analysis took 109 ms [2019-02-25 15:53:38,739 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:53:38,766 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,789 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,824 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,826 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:53:38,875 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,899 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,920 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,924 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,929 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:53:38,932 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:39,498 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:39,748 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:39,942 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,117 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,144 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,169 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,189 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,372 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:53:40,373 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,435 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,469 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,538 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,629 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,675 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,730 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,796 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,925 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:40,925 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:147, output treesize:153 [2019-02-25 15:53:40,984 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,986 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:53:40,987 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,276 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:41,276 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:125 [2019-02-25 15:53:41,314 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-25 15:53:41,314 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:41,340 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-25 15:53:41,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:41,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:53:41,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:41,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:53:41,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:53:41,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:53:41,362 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 6 states. [2019-02-25 15:53:52,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:52,633 INFO L93 Difference]: Finished difference Result 63 states and 92 transitions. [2019-02-25 15:53:52,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:53:52,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:53:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:52,636 INFO L225 Difference]: With dead ends: 63 [2019-02-25 15:53:52,636 INFO L226 Difference]: Without dead ends: 60 [2019-02-25 15:53:52,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 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-25 15:53:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-25 15:53:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 25. [2019-02-25 15:53:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:53:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 53 transitions. [2019-02-25 15:53:52,645 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 53 transitions. Word has length 3 [2019-02-25 15:53:52,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:52,645 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 53 transitions. [2019-02-25 15:53:52,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:53:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 53 transitions. [2019-02-25 15:53:52,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:53:52,646 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:52,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:53:52,647 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:52,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:52,647 INFO L82 PathProgramCache]: Analyzing trace with hash 30384, now seen corresponding path program 1 times [2019-02-25 15:53:52,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:52,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:52,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:52,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:52,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:52,748 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-25 15:53:52,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:52,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:52,749 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:53:52,750 INFO L207 CegarAbsIntRunner]: [0], [18], [35] [2019-02-25 15:53:52,752 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:52,752 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:53,084 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:53,084 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-25 15:53:53,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:53,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:53,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:53,085 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-25 15:53:53,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:53,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:53,121 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:53:53,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:53,145 INFO L467 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 27 treesize of output 30 [2019-02-25 15:53:53,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,188 INFO L467 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 30 treesize of output 36 [2019-02-25 15:53:53,223 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,244 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,246 INFO L467 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 32 treesize of output 46 [2019-02-25 15:53:53,283 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,333 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,335 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:53:53,370 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,445 INFO L292 Elim1Store]: Index analysis took 106 ms [2019-02-25 15:53:53,446 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:53:53,484 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,506 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,533 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,554 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,580 INFO L292 Elim1Store]: Index analysis took 130 ms [2019-02-25 15:53:53,581 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:53:53,614 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,626 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,698 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,726 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:53,726 INFO L292 Elim1Store]: Index analysis took 142 ms [2019-02-25 15:53:53,728 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:53:53,811 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:53:53,811 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:53,873 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:53,994 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:54,032 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:54,072 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:54,096 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:54,117 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:54,134 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:54,264 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:53:54,266 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:54,345 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:54,363 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:54,382 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:54,407 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:54,439 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:54,484 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:54,558 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:54,559 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-02-25 15:53:54,697 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-02-25 15:53:54,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:54,716 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:53:54,717 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:54,784 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:54,785 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-02-25 15:53:54,827 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-25 15:53:54,828 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:54,843 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-25 15:53:54,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:54,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:53:54,863 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:54,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:53:54,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:53:54,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:53:54,864 INFO L87 Difference]: Start difference. First operand 25 states and 53 transitions. Second operand 6 states. [2019-02-25 15:53:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:55,799 INFO L93 Difference]: Finished difference Result 62 states and 99 transitions. [2019-02-25 15:53:55,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:53:55,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:53:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:55,806 INFO L225 Difference]: With dead ends: 62 [2019-02-25 15:53:55,807 INFO L226 Difference]: Without dead ends: 60 [2019-02-25 15:53:55,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 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-25 15:53:55,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-25 15:53:55,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 26. [2019-02-25 15:53:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-25 15:53:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 61 transitions. [2019-02-25 15:53:55,814 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 61 transitions. Word has length 3 [2019-02-25 15:53:55,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:55,815 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 61 transitions. [2019-02-25 15:53:55,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:53:55,815 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 61 transitions. [2019-02-25 15:53:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:53:55,815 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:55,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:53:55,816 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:55,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:55,816 INFO L82 PathProgramCache]: Analyzing trace with hash 30944, now seen corresponding path program 1 times [2019-02-25 15:53:55,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:55,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:55,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:55,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:55,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:55,872 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-25 15:53:55,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:53:55,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:53:55,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:53:55,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:53:55,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:53:55,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:53:55,874 INFO L87 Difference]: Start difference. First operand 26 states and 61 transitions. Second operand 3 states. [2019-02-25 15:53:55,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:55,953 INFO L93 Difference]: Finished difference Result 31 states and 61 transitions. [2019-02-25 15:53:55,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:53:55,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:53:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:55,954 INFO L225 Difference]: With dead ends: 31 [2019-02-25 15:53:55,954 INFO L226 Difference]: Without dead ends: 30 [2019-02-25 15:53:55,954 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-25 15:53:55,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-25 15:53:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-02-25 15:53:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-25 15:53:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 60 transitions. [2019-02-25 15:53:55,961 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 60 transitions. Word has length 3 [2019-02-25 15:53:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:55,961 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 60 transitions. [2019-02-25 15:53:55,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:53:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 60 transitions. [2019-02-25 15:53:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:53:55,962 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:55,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:53:55,962 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:55,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:55,963 INFO L82 PathProgramCache]: Analyzing trace with hash 30012, now seen corresponding path program 1 times [2019-02-25 15:53:55,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:55,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:55,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:55,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:55,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:56,055 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-25 15:53:56,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:56,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:56,056 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:53:56,056 INFO L207 CegarAbsIntRunner]: [0], [6], [35] [2019-02-25 15:53:56,057 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:56,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:56,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:56,393 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-25 15:53:56,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:56,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:56,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:56,394 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-25 15:53:56,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:56,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:56,430 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:53:56,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:56,675 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:53:56,675 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:56,699 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:56,710 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:56,722 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:56,743 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:56,775 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:56,821 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:56,876 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:53:56,882 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:53:56,885 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:53:56,890 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:53:56,914 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:53:56,927 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:53:56,946 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:53:56,977 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:53:56,978 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,032 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,073 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,102 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,128 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,149 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,167 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,184 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,255 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:57,255 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 9 variables, input treesize:121, output treesize:125 [2019-02-25 15:53:57,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:57,285 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:53:57,286 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,348 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:57,349 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-02-25 15:53:57,371 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-25 15:53:57,372 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:57,376 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-25 15:53:57,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:53:57,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:53:57,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:53:57,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:53:57,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:53:57,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:53:57,397 INFO L87 Difference]: Start difference. First operand 26 states and 60 transitions. Second operand 4 states. [2019-02-25 15:53:57,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:57,475 INFO L93 Difference]: Finished difference Result 32 states and 98 transitions. [2019-02-25 15:53:57,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:53:57,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-25 15:53:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:57,477 INFO L225 Difference]: With dead ends: 32 [2019-02-25 15:53:57,477 INFO L226 Difference]: Without dead ends: 31 [2019-02-25 15:53:57,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:53:57,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-25 15:53:57,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-02-25 15:53:57,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-25 15:53:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-02-25 15:53:57,487 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 3 [2019-02-25 15:53:57,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:57,487 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-02-25 15:53:57,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:53:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-02-25 15:53:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:53:57,488 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:57,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:53:57,488 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:57,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:57,488 INFO L82 PathProgramCache]: Analyzing trace with hash 30136, now seen corresponding path program 1 times [2019-02-25 15:53:57,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:57,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:57,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:57,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:57,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:57,584 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-25 15:53:57,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:57,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:57,585 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:53:57,585 INFO L207 CegarAbsIntRunner]: [0], [10], [35] [2019-02-25 15:53:57,586 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:57,586 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:57,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:57,890 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-25 15:53:57,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:57,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:57,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:57,891 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-25 15:53:57,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:57,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:57,910 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:53:57,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:57,929 INFO L467 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 27 treesize of output 30 [2019-02-25 15:53:57,955 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:57,956 INFO L467 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 30 treesize of output 36 [2019-02-25 15:53:57,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:57,963 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:57,964 INFO L467 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 32 treesize of output 46 [2019-02-25 15:53:57,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:57,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:57,981 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:57,982 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:53:57,989 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:57,992 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:57,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:57,998 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:57,999 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:53:58,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,021 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:53:58,027 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,028 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,029 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,030 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,031 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,034 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:53:58,070 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:53:58,072 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,203 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,250 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,288 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,318 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,342 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,364 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,384 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,471 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:53:58,472 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,495 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,505 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,526 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,561 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,603 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,648 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,729 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:58,730 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-02-25 15:53:58,811 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,812 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:53:58,813 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,881 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:58,882 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-02-25 15:53:58,913 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-25 15:53:58,913 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:58,924 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-25 15:53:58,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:58,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:53:58,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:58,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:53:58,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:53:58,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:53:58,944 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 6 states. [2019-02-25 15:53:59,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:59,827 INFO L93 Difference]: Finished difference Result 65 states and 143 transitions. [2019-02-25 15:53:59,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:53:59,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:53:59,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:59,829 INFO L225 Difference]: With dead ends: 65 [2019-02-25 15:53:59,829 INFO L226 Difference]: Without dead ends: 64 [2019-02-25 15:53:59,829 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-25 15:53:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-25 15:53:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-02-25 15:53:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-25 15:53:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 115 transitions. [2019-02-25 15:53:59,838 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 115 transitions. Word has length 3 [2019-02-25 15:53:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:59,838 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 115 transitions. [2019-02-25 15:53:59,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:53:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 115 transitions. [2019-02-25 15:53:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:53:59,839 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:59,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:53:59,839 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:59,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:59,840 INFO L82 PathProgramCache]: Analyzing trace with hash 30632, now seen corresponding path program 1 times [2019-02-25 15:53:59,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:59,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:59,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:59,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:59,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:59,993 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-25 15:53:59,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:59,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:59,994 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:53:59,994 INFO L207 CegarAbsIntRunner]: [0], [26], [35] [2019-02-25 15:53:59,995 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:59,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:00,248 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:00,248 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-25 15:54:00,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:00,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:00,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:00,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 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-25 15:54:00,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:00,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:00,282 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:54:00,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:00,299 INFO L467 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 27 treesize of output 30 [2019-02-25 15:54:00,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,307 INFO L467 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 30 treesize of output 36 [2019-02-25 15:54:00,316 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,318 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,319 INFO L467 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 32 treesize of output 46 [2019-02-25 15:54:00,339 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,344 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:54:00,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,356 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:54:00,367 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,369 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,371 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,375 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,376 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:54:00,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,387 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,392 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,397 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:54:00,419 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:54:00,420 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,479 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,527 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,564 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,593 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,616 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,637 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,656 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,795 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:54:00,797 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,121 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,138 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,158 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,180 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,215 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,256 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,376 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:01,376 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-02-25 15:54:01,422 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:01,423 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:54:01,424 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,492 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:01,493 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-02-25 15:54:01,514 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-25 15:54:01,514 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:01,534 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-25 15:54:01,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:01,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:54:01,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:01,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:54:01,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:54:01,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:54:01,554 INFO L87 Difference]: Start difference. First operand 32 states and 115 transitions. Second operand 6 states. [2019-02-25 15:54:02,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:02,345 INFO L93 Difference]: Finished difference Result 67 states and 161 transitions. [2019-02-25 15:54:02,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:54:02,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:54:02,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:02,347 INFO L225 Difference]: With dead ends: 67 [2019-02-25 15:54:02,347 INFO L226 Difference]: Without dead ends: 65 [2019-02-25 15:54:02,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 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-25 15:54:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-25 15:54:02,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 34. [2019-02-25 15:54:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-25 15:54:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 132 transitions. [2019-02-25 15:54:02,356 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 132 transitions. Word has length 3 [2019-02-25 15:54:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:02,357 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 132 transitions. [2019-02-25 15:54:02,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:54:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 132 transitions. [2019-02-25 15:54:02,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:54:02,358 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:02,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:54:02,358 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:02,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:02,358 INFO L82 PathProgramCache]: Analyzing trace with hash 954866, now seen corresponding path program 1 times [2019-02-25 15:54:02,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:02,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:02,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:02,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:02,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:02,460 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-25 15:54:02,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:02,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:02,460 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:54:02,460 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [35] [2019-02-25 15:54:02,461 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:02,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:03,223 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:03,223 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-25 15:54:03,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:03,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:03,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:03,224 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-25 15:54:03,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:03,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:03,242 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:54:03,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:03,252 INFO L467 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 27 treesize of output 30 [2019-02-25 15:54:03,258 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,258 INFO L467 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 30 treesize of output 36 [2019-02-25 15:54:03,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,274 INFO L467 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 32 treesize of output 46 [2019-02-25 15:54:03,280 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,285 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,286 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:54:03,298 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,301 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,309 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:54:03,316 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,318 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,327 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,328 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:54:03,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,344 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,346 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,346 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:54:03,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,359 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,360 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:54:03,361 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,444 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,518 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,585 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,616 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,642 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,660 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,679 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,783 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:54:03,784 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,819 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,835 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,855 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,886 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,921 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,966 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,030 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,130 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:04,130 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-02-25 15:54:04,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,200 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:54:04,201 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,314 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:04,315 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:125 [2019-02-25 15:54:04,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,402 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,409 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:04,410 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 155 [2019-02-25 15:54:04,411 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,502 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:04,502 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:107 [2019-02-25 15:54:04,564 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-25 15:54:04,564 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:04,600 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-25 15:54:04,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:04,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:54:04,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:04,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:04,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:04,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:54:04,620 INFO L87 Difference]: Start difference. First operand 34 states and 132 transitions. Second operand 8 states. [2019-02-25 15:54:08,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:08,968 INFO L93 Difference]: Finished difference Result 82 states and 191 transitions. [2019-02-25 15:54:08,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:54:08,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:54:08,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:08,970 INFO L225 Difference]: With dead ends: 82 [2019-02-25 15:54:08,970 INFO L226 Difference]: Without dead ends: 80 [2019-02-25 15:54:08,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:08,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-25 15:54:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 36. [2019-02-25 15:54:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-25 15:54:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 128 transitions. [2019-02-25 15:54:08,981 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 128 transitions. Word has length 4 [2019-02-25 15:54:08,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:08,981 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 128 transitions. [2019-02-25 15:54:08,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 128 transitions. [2019-02-25 15:54:08,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:54:08,982 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:08,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:54:08,982 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:08,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:08,983 INFO L82 PathProgramCache]: Analyzing trace with hash 955426, now seen corresponding path program 1 times [2019-02-25 15:54:08,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:08,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:08,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:08,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:08,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:09,055 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-25 15:54:09,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:09,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:09,056 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:54:09,056 INFO L207 CegarAbsIntRunner]: [0], [32], [36], [37] [2019-02-25 15:54:09,057 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:09,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:10,715 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:10,716 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-25 15:54:10,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:10,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:10,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:10,716 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-25 15:54:10,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:10,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:10,754 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:54:10,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:10,858 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:54:10,859 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:10,885 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:10,912 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:10,941 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:10,991 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:11,054 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:11,125 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 27 treesize of output 30 [2019-02-25 15:54:11,132 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-02-25 15:54:11,140 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-02-25 15:54:11,144 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 17 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 56 [2019-02-25 15:54:11,151 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-02-25 15:54:11,157 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 96 [2019-02-25 15:54:11,169 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 122 [2019-02-25 15:54:11,186 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 121 [2019-02-25 15:54:11,187 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:11,283 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:11,338 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:11,370 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:11,394 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:11,415 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:11,432 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:11,449 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:11,519 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:11,520 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:113, output treesize:121 [2019-02-25 15:54:12,212 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,310 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 14 case distinctions, treesize of input 51 treesize of output 149 [2019-02-25 15:54:12,311 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-02-25 15:54:12,373 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 128 xjuncts. [2019-02-25 15:54:14,389 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 54 dim-0 vars, and 9 xjuncts. [2019-02-25 15:54:14,389 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:131, output treesize:873 [2019-02-25 15:54:31,574 WARN L181 SmtUtils]: Spent 13.40 s on a formula simplification. DAG size of input: 478 DAG size of output: 101 [2019-02-25 15:54:31,580 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-25 15:54:31,581 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:31,586 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-25 15:54:31,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:54:31,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:54:31,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:54:31,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:54:31,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:54:31,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=22, Unknown=1, NotChecked=0, Total=42 [2019-02-25 15:54:31,606 INFO L87 Difference]: Start difference. First operand 36 states and 128 transitions. Second operand 4 states. [2019-02-25 15:54:31,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:31,809 INFO L93 Difference]: Finished difference Result 40 states and 140 transitions. [2019-02-25 15:54:31,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:54:31,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:54:31,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:31,810 INFO L225 Difference]: With dead ends: 40 [2019-02-25 15:54:31,810 INFO L226 Difference]: Without dead ends: 39 [2019-02-25 15:54:31,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=19, Invalid=22, Unknown=1, NotChecked=0, Total=42 [2019-02-25 15:54:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-25 15:54:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-02-25 15:54:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-25 15:54:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 138 transitions. [2019-02-25 15:54:31,824 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 138 transitions. Word has length 4 [2019-02-25 15:54:31,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:31,824 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 138 transitions. [2019-02-25 15:54:31,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:54:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 138 transitions. [2019-02-25 15:54:31,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:54:31,825 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:31,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:54:31,826 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:31,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:31,826 INFO L82 PathProgramCache]: Analyzing trace with hash 954990, now seen corresponding path program 1 times [2019-02-25 15:54:31,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:31,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:31,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:31,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:31,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:31,965 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-25 15:54:31,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:31,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:31,965 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:54:31,966 INFO L207 CegarAbsIntRunner]: [0], [22], [32], [35] [2019-02-25 15:54:31,967 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:31,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:32,589 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:32,589 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-25 15:54:32,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:32,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:32,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:32,589 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-25 15:54:32,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:32,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:32,604 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:54:32,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:32,941 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:54:32,942 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,028 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,064 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,104 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,145 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,199 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,265 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,343 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,433 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:54:33,436 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:54:33,441 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:54:33,445 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:54:33,452 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:54:33,456 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:54:33,460 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:54:33,466 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:54:33,467 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,540 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,584 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,617 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,641 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,661 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,679 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,697 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,796 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:33,796 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-02-25 15:54:33,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,836 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:54:33,837 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,949 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:33,949 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:125 [2019-02-25 15:54:33,976 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,977 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,981 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,984 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,985 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,986 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 31 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 155 [2019-02-25 15:54:33,987 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:34,075 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:34,076 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:103 [2019-02-25 15:54:34,201 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-25 15:54:34,201 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:34,223 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-25 15:54:34,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:34,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:54:34,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:34,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:34,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:34,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:54:34,246 INFO L87 Difference]: Start difference. First operand 38 states and 138 transitions. Second operand 8 states. [2019-02-25 15:54:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:38,151 INFO L93 Difference]: Finished difference Result 84 states and 220 transitions. [2019-02-25 15:54:38,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:54:38,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:54:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:38,153 INFO L225 Difference]: With dead ends: 84 [2019-02-25 15:54:38,153 INFO L226 Difference]: Without dead ends: 82 [2019-02-25 15:54:38,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:38,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-25 15:54:38,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 43. [2019-02-25 15:54:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-25 15:54:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 174 transitions. [2019-02-25 15:54:38,165 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 174 transitions. Word has length 4 [2019-02-25 15:54:38,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:38,165 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 174 transitions. [2019-02-25 15:54:38,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 174 transitions. [2019-02-25 15:54:38,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:54:38,166 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:38,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:54:38,166 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:38,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:38,167 INFO L82 PathProgramCache]: Analyzing trace with hash 954618, now seen corresponding path program 1 times [2019-02-25 15:54:38,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:38,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:38,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:38,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:38,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:38,507 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-02-25 15:54:38,578 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-25 15:54:38,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:38,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:38,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:54:38,579 INFO L207 CegarAbsIntRunner]: [0], [10], [32], [35] [2019-02-25 15:54:38,580 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:38,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:39,171 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:39,172 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-25 15:54:39,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:39,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:39,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:39,172 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-25 15:54:39,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:39,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:39,211 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:54:39,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:39,332 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:54:39,333 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:39,420 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:39,433 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:39,461 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:39,501 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:39,544 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:39,604 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:39,671 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:39,750 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:54:39,761 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:54:39,764 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:54:39,770 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:54:39,773 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:54:39,777 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:54:39,782 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:54:39,786 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:54:39,787 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:39,860 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:39,902 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:39,936 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:39,961 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:39,983 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,002 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,017 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,114 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:40,115 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-02-25 15:54:40,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,155 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:54:40,155 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,460 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:40,461 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:125 [2019-02-25 15:54:40,492 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,493 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,494 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,495 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,496 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,497 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,498 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,499 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,500 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:40,501 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 155 [2019-02-25 15:54:40,502 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,593 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:40,594 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:107 [2019-02-25 15:54:40,620 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-25 15:54:40,620 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:40,643 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-25 15:54:40,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:40,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:54:40,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:40,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:40,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:40,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:54:40,664 INFO L87 Difference]: Start difference. First operand 43 states and 174 transitions. Second operand 8 states. [2019-02-25 15:54:44,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:44,621 INFO L93 Difference]: Finished difference Result 81 states and 223 transitions. [2019-02-25 15:54:44,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:54:44,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:54:44,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:44,623 INFO L225 Difference]: With dead ends: 81 [2019-02-25 15:54:44,623 INFO L226 Difference]: Without dead ends: 80 [2019-02-25 15:54:44,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:44,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-25 15:54:44,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 43. [2019-02-25 15:54:44,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-25 15:54:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 174 transitions. [2019-02-25 15:54:44,634 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 174 transitions. Word has length 4 [2019-02-25 15:54:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:44,635 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 174 transitions. [2019-02-25 15:54:44,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 174 transitions. [2019-02-25 15:54:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:54:44,635 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:44,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:54:44,636 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:44,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:44,636 INFO L82 PathProgramCache]: Analyzing trace with hash 955114, now seen corresponding path program 1 times [2019-02-25 15:54:44,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:44,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:44,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:44,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:44,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:44,758 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-25 15:54:44,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:44,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:44,759 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:54:44,759 INFO L207 CegarAbsIntRunner]: [0], [26], [32], [35] [2019-02-25 15:54:44,760 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:44,760 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:45,391 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:45,391 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-25 15:54:45,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:45,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:45,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:45,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 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-25 15:54:45,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:45,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:45,406 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:54:45,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:45,524 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:54:45,525 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:45,565 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:45,593 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:45,629 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:45,689 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:45,748 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:45,816 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:45,899 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:45,993 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:54:45,998 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:54:46,001 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:54:46,005 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:54:46,010 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:54:46,019 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:54:46,023 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:54:46,028 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:54:46,028 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,102 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,146 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,180 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,206 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,228 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,247 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,264 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,398 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:46,399 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-02-25 15:54:46,431 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,432 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:54:46,432 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,525 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:46,526 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:125 [2019-02-25 15:54:46,554 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,554 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,556 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,557 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,558 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,559 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,561 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,562 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,563 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:46,564 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 155 [2019-02-25 15:54:46,565 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,658 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:46,658 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:107 [2019-02-25 15:54:46,804 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-25 15:54:46,804 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:46,828 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-25 15:54:46,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:46,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:54:46,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:46,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:46,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:46,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:54:46,848 INFO L87 Difference]: Start difference. First operand 43 states and 174 transitions. Second operand 8 states. [2019-02-25 15:54:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:48,355 INFO L93 Difference]: Finished difference Result 81 states and 223 transitions. [2019-02-25 15:54:48,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:54:48,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:54:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:48,357 INFO L225 Difference]: With dead ends: 81 [2019-02-25 15:54:48,357 INFO L226 Difference]: Without dead ends: 79 [2019-02-25 15:54:48,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-25 15:54:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 44. [2019-02-25 15:54:48,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-25 15:54:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 175 transitions. [2019-02-25 15:54:48,369 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 175 transitions. Word has length 4 [2019-02-25 15:54:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:48,369 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 175 transitions. [2019-02-25 15:54:48,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 175 transitions. [2019-02-25 15:54:48,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:54:48,370 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:48,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:54:48,371 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:48,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:48,371 INFO L82 PathProgramCache]: Analyzing trace with hash 954742, now seen corresponding path program 1 times [2019-02-25 15:54:48,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:48,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:48,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:48,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:48,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:48,548 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 12 [2019-02-25 15:54:48,578 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-25 15:54:48,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:48,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:48,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:54:48,579 INFO L207 CegarAbsIntRunner]: [0], [14], [32], [35] [2019-02-25 15:54:48,581 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:48,581 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:49,246 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:49,247 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-25 15:54:49,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:49,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:49,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:49,247 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-25 15:54:49,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:49,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:49,280 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:54:49,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:49,295 INFO L467 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 27 treesize of output 30 [2019-02-25 15:54:49,300 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,301 INFO L467 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 30 treesize of output 36 [2019-02-25 15:54:49,313 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,315 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,315 INFO L467 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 32 treesize of output 46 [2019-02-25 15:54:49,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,325 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,327 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,328 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:54:49,333 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,340 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:54:49,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,359 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,360 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:54:49,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,388 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,392 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,393 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:54:49,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,404 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,407 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:54:49,408 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,490 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,535 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,573 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,603 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,627 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,646 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,667 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,828 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:54:49,828 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,862 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,874 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,900 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,930 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,967 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:50,016 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:50,079 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:50,176 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:50,177 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-02-25 15:54:50,428 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-02-25 15:54:50,473 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:50,475 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:54:50,476 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,383 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:51,384 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:125 [2019-02-25 15:54:51,613 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-02-25 15:54:51,662 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,680 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,701 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,724 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,822 INFO L292 Elim1Store]: Index analysis took 200 ms [2019-02-25 15:54:51,823 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 31 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 155 [2019-02-25 15:54:51,824 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:52,762 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:52,762 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:103 [2019-02-25 15:54:53,157 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-02-25 15:54:53,159 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-25 15:54:53,159 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:53,581 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-25 15:54:53,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:53,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:54:53,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:53,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:53,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:53,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:54:53,614 INFO L87 Difference]: Start difference. First operand 44 states and 175 transitions. Second operand 8 states. [2019-02-25 15:54:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:57,074 INFO L93 Difference]: Finished difference Result 99 states and 274 transitions. [2019-02-25 15:54:57,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:54:57,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:54:57,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:57,076 INFO L225 Difference]: With dead ends: 99 [2019-02-25 15:54:57,076 INFO L226 Difference]: Without dead ends: 95 [2019-02-25 15:54:57,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:54:57,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-25 15:54:57,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 52. [2019-02-25 15:54:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-25 15:54:57,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 210 transitions. [2019-02-25 15:54:57,087 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 210 transitions. Word has length 4 [2019-02-25 15:54:57,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:57,088 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 210 transitions. [2019-02-25 15:54:57,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:57,088 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 210 transitions. [2019-02-25 15:54:57,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:54:57,088 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:57,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:54:57,089 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:57,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:57,089 INFO L82 PathProgramCache]: Analyzing trace with hash 941536, now seen corresponding path program 1 times [2019-02-25 15:54:57,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:57,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:57,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:57,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:57,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:57,394 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-02-25 15:54:57,617 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-25 15:54:57,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:57,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:57,618 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:54:57,618 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [35] [2019-02-25 15:54:57,620 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:57,620 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:57,974 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:57,975 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-25 15:54:57,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:57,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:57,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:57,975 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-25 15:54:57,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:57,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:57,991 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:54:57,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:57,997 INFO L467 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 27 treesize of output 30 [2019-02-25 15:54:58,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,005 INFO L467 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 30 treesize of output 36 [2019-02-25 15:54:58,013 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,016 INFO L467 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 32 treesize of output 46 [2019-02-25 15:54:58,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,026 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,027 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:54:58,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,037 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,040 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:54:58,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,054 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,057 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,060 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,061 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:54:58,070 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,071 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,073 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,076 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,078 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,079 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:54:58,092 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:54:58,093 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,155 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,202 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,237 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,265 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,289 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,308 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,328 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,404 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:54:58,405 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,453 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,465 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,487 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,510 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,547 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,591 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,662 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:58,663 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:54:58,711 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,714 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:54:58,714 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,777 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:58,777 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:54:58,806 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,807 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,809 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,810 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,813 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,814 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:54:58,814 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,875 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:58,876 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-02-25 15:54:58,897 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-25 15:54:58,898 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:58,918 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-25 15:54:58,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:58,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:54:58,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:58,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:58,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:58,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:54:58,938 INFO L87 Difference]: Start difference. First operand 52 states and 210 transitions. Second operand 8 states. [2019-02-25 15:54:59,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:59,425 INFO L93 Difference]: Finished difference Result 101 states and 289 transitions. [2019-02-25 15:54:59,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:54:59,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:54:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:59,427 INFO L225 Difference]: With dead ends: 101 [2019-02-25 15:54:59,427 INFO L226 Difference]: Without dead ends: 99 [2019-02-25 15:54:59,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:59,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-25 15:54:59,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 59. [2019-02-25 15:54:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-25 15:54:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 243 transitions. [2019-02-25 15:54:59,443 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 243 transitions. Word has length 4 [2019-02-25 15:54:59,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:59,443 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 243 transitions. [2019-02-25 15:54:59,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:59,444 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 243 transitions. [2019-02-25 15:54:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:54:59,444 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:59,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:54:59,445 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:59,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:59,445 INFO L82 PathProgramCache]: Analyzing trace with hash 941164, now seen corresponding path program 1 times [2019-02-25 15:54:59,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:59,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:59,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:59,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:59,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:59,514 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-25 15:54:59,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:59,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:59,514 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:54:59,515 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [35] [2019-02-25 15:54:59,518 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:59,518 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:59,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:59,765 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-25 15:54:59,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:59,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:59,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:59,765 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-25 15:54:59,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:59,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:59,779 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:54:59,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:59,850 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:54:59,851 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:59,874 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:59,883 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:59,904 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:59,928 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:59,962 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,009 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,064 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:55:00,069 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:55:00,071 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:55:00,075 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:55:00,080 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:55:00,084 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:55:00,113 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:55:00,282 INFO L292 Elim1Store]: Index analysis took 167 ms [2019-02-25 15:55:00,284 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:55:00,285 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:01,011 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:01,606 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,061 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,405 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,484 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,503 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,519 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,596 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:02,596 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:55:02,679 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,680 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:02,680 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,748 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:02,748 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:55:02,792 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,792 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,794 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,796 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,796 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:02,797 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:55:02,798 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,862 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:02,863 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:82 [2019-02-25 15:55:02,890 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-25 15:55:02,890 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:02,912 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-25 15:55:02,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:02,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:55:02,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:02,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:55:02,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:55:02,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:55:02,933 INFO L87 Difference]: Start difference. First operand 59 states and 243 transitions. Second operand 8 states. [2019-02-25 15:55:03,279 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-02-25 15:55:03,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:03,867 INFO L93 Difference]: Finished difference Result 99 states and 302 transitions. [2019-02-25 15:55:03,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:55:03,868 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:55:03,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:03,870 INFO L225 Difference]: With dead ends: 99 [2019-02-25 15:55:03,870 INFO L226 Difference]: Without dead ends: 98 [2019-02-25 15:55:03,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:55:03,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-25 15:55:03,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 61. [2019-02-25 15:55:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:55:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 261 transitions. [2019-02-25 15:55:03,885 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 261 transitions. Word has length 4 [2019-02-25 15:55:03,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:03,886 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 261 transitions. [2019-02-25 15:55:03,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:55:03,886 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 261 transitions. [2019-02-25 15:55:03,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:55:03,887 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:03,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:55:03,887 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:03,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:03,887 INFO L82 PathProgramCache]: Analyzing trace with hash 941660, now seen corresponding path program 1 times [2019-02-25 15:55:03,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:03,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:03,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:03,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:03,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:03,972 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-25 15:55:03,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:03,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:03,972 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:55:03,972 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [35] [2019-02-25 15:55:03,973 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:03,973 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:04,207 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:04,207 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-25 15:55:04,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:04,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:04,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:04,208 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-25 15:55:04,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:04,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:04,245 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:55:04,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:04,265 INFO L467 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 27 treesize of output 30 [2019-02-25 15:55:04,274 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,275 INFO L467 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 30 treesize of output 36 [2019-02-25 15:55:04,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,283 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,284 INFO L467 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 32 treesize of output 46 [2019-02-25 15:55:04,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,297 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:55:04,301 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,302 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,308 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:55:04,311 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,312 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,314 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,315 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,316 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,318 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:55:04,329 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,331 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,333 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,340 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:55:04,358 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:55:04,359 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,419 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,468 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,506 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,539 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,564 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,586 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,604 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,691 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:55:04,692 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,734 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,747 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,770 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,802 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,839 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,883 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,954 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:04,954 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:55:05,014 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:05,014 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:05,015 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:05,081 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:05,081 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:55:05,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:05,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:05,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:05,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:05,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:05,119 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:05,120 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:05,121 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:55:05,121 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:05,185 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:05,186 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:82 [2019-02-25 15:55:05,206 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-25 15:55:05,206 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:05,227 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-25 15:55:05,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:05,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:55:05,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:05,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:55:05,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:55:05,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:55:05,248 INFO L87 Difference]: Start difference. First operand 61 states and 261 transitions. Second operand 8 states. [2019-02-25 15:55:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:05,869 INFO L93 Difference]: Finished difference Result 101 states and 320 transitions. [2019-02-25 15:55:05,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:55:05,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:55:05,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:05,870 INFO L225 Difference]: With dead ends: 101 [2019-02-25 15:55:05,871 INFO L226 Difference]: Without dead ends: 99 [2019-02-25 15:55:05,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:55:05,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-25 15:55:05,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 62. [2019-02-25 15:55:05,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-25 15:55:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 278 transitions. [2019-02-25 15:55:05,888 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 278 transitions. Word has length 4 [2019-02-25 15:55:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:05,888 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 278 transitions. [2019-02-25 15:55:05,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:55:05,888 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 278 transitions. [2019-02-25 15:55:05,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:55:05,889 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:05,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:55:05,889 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:05,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:05,890 INFO L82 PathProgramCache]: Analyzing trace with hash 941288, now seen corresponding path program 1 times [2019-02-25 15:55:05,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:05,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:05,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:05,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:05,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:05,990 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-25 15:55:05,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:05,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:05,990 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:55:05,990 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [35] [2019-02-25 15:55:05,992 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:05,992 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:06,232 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:06,232 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-25 15:55:06,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:06,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:06,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:06,233 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-25 15:55:06,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:06,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:06,246 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:55:06,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:06,374 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:55:06,374 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,399 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,423 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,445 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,475 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,515 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,565 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,616 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:55:06,619 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:55:06,623 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:55:06,627 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:55:06,645 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:55:06,650 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:55:06,653 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:55:06,692 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:55:06,693 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,748 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,791 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,822 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,849 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,870 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,889 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,905 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,977 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:06,978 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:55:07,031 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:07,032 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:07,033 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:07,098 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:07,098 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:55:07,124 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:07,125 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:07,129 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:07,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:07,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:07,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:07,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:07,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:07,134 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:55:07,135 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:07,198 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:07,199 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-02-25 15:55:07,221 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-25 15:55:07,222 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:07,249 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-25 15:55:07,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:07,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:55:07,269 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:07,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:55:07,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:55:07,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:55:07,270 INFO L87 Difference]: Start difference. First operand 62 states and 278 transitions. Second operand 8 states. [2019-02-25 15:55:07,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:07,947 INFO L93 Difference]: Finished difference Result 106 states and 350 transitions. [2019-02-25 15:55:07,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:55:07,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:55:07,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:07,949 INFO L225 Difference]: With dead ends: 106 [2019-02-25 15:55:07,949 INFO L226 Difference]: Without dead ends: 104 [2019-02-25 15:55:07,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:55:07,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-25 15:55:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 65. [2019-02-25 15:55:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-25 15:55:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 304 transitions. [2019-02-25 15:55:07,966 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 304 transitions. Word has length 4 [2019-02-25 15:55:07,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:07,966 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 304 transitions. [2019-02-25 15:55:07,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:55:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 304 transitions. [2019-02-25 15:55:07,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:55:07,967 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:07,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:55:07,968 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:07,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:07,968 INFO L82 PathProgramCache]: Analyzing trace with hash 941784, now seen corresponding path program 1 times [2019-02-25 15:55:07,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:07,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:07,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:07,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:07,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:08,034 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-25 15:55:08,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:08,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:08,034 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:55:08,034 INFO L207 CegarAbsIntRunner]: [0], [18], [30], [35] [2019-02-25 15:55:08,036 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:08,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:08,287 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:08,288 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-25 15:55:08,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:08,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:08,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:08,288 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-25 15:55:08,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:08,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:08,320 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:55:08,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:08,330 INFO L467 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 27 treesize of output 30 [2019-02-25 15:55:08,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,359 INFO L467 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 30 treesize of output 36 [2019-02-25 15:55:08,371 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,374 INFO L467 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 32 treesize of output 46 [2019-02-25 15:55:08,387 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,394 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:55:08,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,402 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,404 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,405 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:55:08,411 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,411 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,412 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,413 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,414 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,415 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:55:08,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,423 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,424 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,425 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,427 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:55:08,466 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:55:08,467 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,526 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,572 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,607 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,634 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,658 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,676 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,693 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,771 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:55:08,771 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,796 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,812 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,840 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,875 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,914 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,957 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:09,029 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:09,029 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:55:09,073 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,074 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:09,074 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:09,138 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:09,138 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:55:09,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,164 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,165 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,166 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,167 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,168 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,170 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:55:09,170 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:09,231 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:09,232 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-02-25 15:55:09,266 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-25 15:55:09,267 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:09,288 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-25 15:55:09,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:09,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:55:09,308 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:09,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:55:09,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:55:09,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:55:09,309 INFO L87 Difference]: Start difference. First operand 65 states and 304 transitions. Second operand 8 states. [2019-02-25 15:55:10,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:10,018 INFO L93 Difference]: Finished difference Result 107 states and 376 transitions. [2019-02-25 15:55:10,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:55:10,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:55:10,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:10,020 INFO L225 Difference]: With dead ends: 107 [2019-02-25 15:55:10,020 INFO L226 Difference]: Without dead ends: 99 [2019-02-25 15:55:10,021 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-25 15:55:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-25 15:55:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 66. [2019-02-25 15:55:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-25 15:55:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 328 transitions. [2019-02-25 15:55:10,035 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 328 transitions. Word has length 4 [2019-02-25 15:55:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:10,036 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 328 transitions. [2019-02-25 15:55:10,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:55:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 328 transitions. [2019-02-25 15:55:10,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:55:10,037 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:10,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:55:10,037 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:10,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:10,038 INFO L82 PathProgramCache]: Analyzing trace with hash 930314, now seen corresponding path program 1 times [2019-02-25 15:55:10,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:10,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:10,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:10,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:10,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:10,172 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-25 15:55:10,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:10,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:10,172 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:55:10,172 INFO L207 CegarAbsIntRunner]: [0], [6], [32], [35] [2019-02-25 15:55:10,173 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:10,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:11,105 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:11,106 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-25 15:55:11,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:11,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:11,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:11,107 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-25 15:55:11,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:11,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:11,152 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:55:11,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:11,630 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:55:11,631 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,657 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,668 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,686 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,718 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,752 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,800 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,853 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:55:11,857 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:55:11,860 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:55:11,864 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:55:11,868 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:55:11,873 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:55:11,877 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:55:11,888 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:55:11,889 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,946 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,990 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,021 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,046 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,066 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,082 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,099 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,171 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:12,172 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-02-25 15:55:12,257 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,268 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 129 [2019-02-25 15:55:12,270 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:55:12,522 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2019-02-25 15:55:12,522 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:135, output treesize:201 [2019-02-25 15:55:12,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,598 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,603 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,605 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,608 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,658 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 25 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 12 case distinctions, treesize of input 111 treesize of output 153 [2019-02-25 15:55:12,659 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-02-25 15:55:12,676 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 64 xjuncts. [2019-02-25 15:55:13,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,834 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,836 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:13,837 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 120 [2019-02-25 15:55:13,838 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:14,246 INFO L301 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 2 dim-1 vars, End of recursive call: 49 dim-0 vars, and 8 xjuncts. [2019-02-25 15:55:14,247 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 15 variables, input treesize:218, output treesize:686 [2019-02-25 15:55:15,140 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 114 [2019-02-25 15:55:15,141 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-25 15:55:15,142 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:15,148 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-25 15:55:15,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:15,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-02-25 15:55:15,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:15,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:55:15,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:55:15,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:55:15,170 INFO L87 Difference]: Start difference. First operand 66 states and 328 transitions. Second operand 8 states. [2019-02-25 15:55:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:19,230 INFO L93 Difference]: Finished difference Result 155 states and 556 transitions. [2019-02-25 15:55:19,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:55:19,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:55:19,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:19,232 INFO L225 Difference]: With dead ends: 155 [2019-02-25 15:55:19,232 INFO L226 Difference]: Without dead ends: 152 [2019-02-25 15:55:19,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:55:19,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-25 15:55:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 78. [2019-02-25 15:55:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-25 15:55:19,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 438 transitions. [2019-02-25 15:55:19,249 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 438 transitions. Word has length 4 [2019-02-25 15:55:19,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:19,249 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 438 transitions. [2019-02-25 15:55:19,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:55:19,249 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 438 transitions. [2019-02-25 15:55:19,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:55:19,250 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:19,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:55:19,251 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:19,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:19,251 INFO L82 PathProgramCache]: Analyzing trace with hash 930440, now seen corresponding path program 1 times [2019-02-25 15:55:19,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:19,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:19,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:19,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:19,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:19,439 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-25 15:55:19,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:19,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:19,440 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:55:19,440 INFO L207 CegarAbsIntRunner]: [0], [6], [36], [37] [2019-02-25 15:55:19,442 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:19,442 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:19,711 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:19,711 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-25 15:55:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:19,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:19,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:19,712 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-25 15:55:19,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:19,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:19,728 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:55:19,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:19,736 INFO L467 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 27 treesize of output 30 [2019-02-25 15:55:19,746 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,746 INFO L467 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 30 treesize of output 36 [2019-02-25 15:55:19,752 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,758 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,759 INFO L467 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 32 treesize of output 46 [2019-02-25 15:55:19,765 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,768 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,771 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,771 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:55:19,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,779 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,782 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:55:19,787 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,789 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,794 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,795 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:55:19,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,803 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,807 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,810 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:55:19,821 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:55:19,821 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,884 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,932 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,968 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,998 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:20,020 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:20,038 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:20,055 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:20,132 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:55:20,133 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:20,156 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:20,174 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:20,195 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:20,219 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:20,251 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:20,295 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:20,367 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:20,367 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-02-25 15:55:20,404 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:20,406 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:20,406 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:20,474 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:20,474 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-02-25 15:55:20,494 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-25 15:55:20,494 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:20,505 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-25 15:55:20,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:20,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:55:20,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:20,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:55:20,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:55:20,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:55:20,524 INFO L87 Difference]: Start difference. First operand 78 states and 438 transitions. Second operand 6 states. [2019-02-25 15:55:20,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:20,852 INFO L93 Difference]: Finished difference Result 104 states and 471 transitions. [2019-02-25 15:55:20,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:55:20,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:55:20,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:20,855 INFO L225 Difference]: With dead ends: 104 [2019-02-25 15:55:20,855 INFO L226 Difference]: Without dead ends: 103 [2019-02-25 15:55:20,856 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-25 15:55:20,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-25 15:55:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 80. [2019-02-25 15:55:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-25 15:55:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 448 transitions. [2019-02-25 15:55:20,875 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 448 transitions. Word has length 4 [2019-02-25 15:55:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:20,875 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 448 transitions. [2019-02-25 15:55:20,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:55:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 448 transitions. [2019-02-25 15:55:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:55:20,876 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:20,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:55:20,877 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:20,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:20,877 INFO L82 PathProgramCache]: Analyzing trace with hash 945816, now seen corresponding path program 1 times [2019-02-25 15:55:20,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:20,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:20,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:20,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:20,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:21,055 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-25 15:55:21,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:21,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:21,056 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:55:21,056 INFO L207 CegarAbsIntRunner]: [0], [22], [36], [37] [2019-02-25 15:55:21,057 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:21,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:21,238 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:21,238 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-25 15:55:21,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:21,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:21,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:21,238 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-25 15:55:21,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:21,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:21,255 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:55:21,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:21,259 INFO L467 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 27 treesize of output 30 [2019-02-25 15:55:21,264 INFO L467 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 30 treesize of output 32 [2019-02-25 15:55:21,272 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,278 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,279 INFO L467 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 32 treesize of output 42 [2019-02-25 15:55:21,286 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,288 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,291 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 56 [2019-02-25 15:55:21,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,300 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,301 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,303 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,304 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-02-25 15:55:21,313 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,314 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,319 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,320 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,322 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,323 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 96 [2019-02-25 15:55:21,330 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,342 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,345 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,346 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 122 [2019-02-25 15:55:21,359 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 121 [2019-02-25 15:55:21,360 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:21,416 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:21,461 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:21,496 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:21,522 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:21,545 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:21,565 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:21,582 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:21,681 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:55:21,682 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:21,698 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:21,710 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:21,728 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:21,758 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:21,800 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:21,868 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:21,869 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:113, output treesize:121 [2019-02-25 15:55:21,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:21,904 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 116 [2019-02-25 15:55:21,904 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:21,966 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:21,967 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:126, output treesize:92 [2019-02-25 15:55:21,985 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-25 15:55:21,985 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:21,998 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-25 15:55:22,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:22,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:55:22,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:22,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:55:22,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:55:22,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:55:22,018 INFO L87 Difference]: Start difference. First operand 80 states and 448 transitions. Second operand 6 states. [2019-02-25 15:55:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:22,365 INFO L93 Difference]: Finished difference Result 108 states and 483 transitions. [2019-02-25 15:55:22,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:55:22,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:55:22,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:22,367 INFO L225 Difference]: With dead ends: 108 [2019-02-25 15:55:22,367 INFO L226 Difference]: Without dead ends: 107 [2019-02-25 15:55:22,368 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-25 15:55:22,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-25 15:55:22,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 80. [2019-02-25 15:55:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-25 15:55:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 448 transitions. [2019-02-25 15:55:22,388 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 448 transitions. Word has length 4 [2019-02-25 15:55:22,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:22,388 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 448 transitions. [2019-02-25 15:55:22,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:55:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 448 transitions. [2019-02-25 15:55:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:55:22,388 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:22,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:55:22,389 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:22,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:22,389 INFO L82 PathProgramCache]: Analyzing trace with hash 945008, now seen corresponding path program 1 times [2019-02-25 15:55:22,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:22,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:22,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:22,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:22,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:22,582 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2019-02-25 15:55:22,610 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-25 15:55:22,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:22,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:22,611 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:55:22,611 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [35] [2019-02-25 15:55:22,612 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:22,612 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:22,864 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:22,864 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-25 15:55:22,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:22,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:22,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:22,865 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-25 15:55:22,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:22,873 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:22,879 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:55:22,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:22,947 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:55:22,948 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,972 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,982 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:23,002 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:23,026 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:23,059 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:23,107 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:23,159 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:55:23,167 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:55:23,170 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:55:23,174 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:55:23,178 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:55:23,182 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:55:23,185 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:55:23,194 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:55:23,195 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:23,250 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:23,293 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:23,324 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:23,351 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:23,370 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:23,389 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:23,406 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:23,487 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:23,487 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:55:23,543 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:23,543 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:23,544 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:23,609 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:23,609 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:55:23,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:23,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:23,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:23,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:23,651 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:23,652 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:23,654 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:23,656 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:23,657 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:23,657 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:23,739 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:23,739 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:76 [2019-02-25 15:55:23,762 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-25 15:55:23,762 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:23,801 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-25 15:55:23,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:23,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:55:23,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:23,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:55:23,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:55:23,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:55:23,822 INFO L87 Difference]: Start difference. First operand 80 states and 448 transitions. Second operand 8 states. [2019-02-25 15:55:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:25,302 INFO L93 Difference]: Finished difference Result 154 states and 652 transitions. [2019-02-25 15:55:25,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:55:25,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:55:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:25,308 INFO L225 Difference]: With dead ends: 154 [2019-02-25 15:55:25,308 INFO L226 Difference]: Without dead ends: 153 [2019-02-25 15:55:25,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:55:25,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-02-25 15:55:25,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 92. [2019-02-25 15:55:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-25 15:55:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 556 transitions. [2019-02-25 15:55:25,325 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 556 transitions. Word has length 4 [2019-02-25 15:55:25,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:25,325 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 556 transitions. [2019-02-25 15:55:25,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:55:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 556 transitions. [2019-02-25 15:55:25,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:55:25,326 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:25,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:55:25,326 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:25,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:25,327 INFO L82 PathProgramCache]: Analyzing trace with hash 945504, now seen corresponding path program 1 times [2019-02-25 15:55:25,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:25,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:25,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:25,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:25,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:25,467 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-25 15:55:25,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:25,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:25,468 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:55:25,468 INFO L207 CegarAbsIntRunner]: [0], [22], [26], [35] [2019-02-25 15:55:25,470 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:25,470 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:25,730 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:25,730 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-25 15:55:25,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:25,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:25,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:25,731 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-25 15:55:25,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:25,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:25,744 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:55:25,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:25,749 INFO L467 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 27 treesize of output 30 [2019-02-25 15:55:25,755 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,756 INFO L467 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 30 treesize of output 36 [2019-02-25 15:55:25,762 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,765 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,765 INFO L467 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 32 treesize of output 46 [2019-02-25 15:55:25,771 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,773 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,776 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:55:25,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,807 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,809 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,814 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,814 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:55:25,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,824 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,830 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:55:25,838 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,839 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,840 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,841 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,843 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,846 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:55:25,866 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:55:25,867 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,930 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,978 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:26,016 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:26,045 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:26,070 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:26,092 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:26,109 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:26,187 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:55:26,187 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:26,211 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:26,219 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:26,239 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:26,264 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:26,292 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:26,335 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:26,407 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:26,407 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:55:26,512 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:26,513 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:26,513 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:27,068 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:27,068 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:55:27,094 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,095 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,096 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,099 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,103 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:27,103 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:27,165 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:27,165 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:76 [2019-02-25 15:55:27,185 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-25 15:55:27,185 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:27,217 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-25 15:55:27,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:27,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:55:27,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:27,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:55:27,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:55:27,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:55:27,239 INFO L87 Difference]: Start difference. First operand 92 states and 556 transitions. Second operand 8 states. [2019-02-25 15:55:27,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:27,962 INFO L93 Difference]: Finished difference Result 148 states and 688 transitions. [2019-02-25 15:55:27,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:55:27,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:55:27,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:27,965 INFO L225 Difference]: With dead ends: 148 [2019-02-25 15:55:27,965 INFO L226 Difference]: Without dead ends: 146 [2019-02-25 15:55:27,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:55:27,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-02-25 15:55:27,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 103. [2019-02-25 15:55:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-25 15:55:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 590 transitions. [2019-02-25 15:55:27,988 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 590 transitions. Word has length 4 [2019-02-25 15:55:27,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:27,988 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 590 transitions. [2019-02-25 15:55:27,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:55:27,988 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 590 transitions. [2019-02-25 15:55:27,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:55:27,989 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:27,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:55:27,989 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:27,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:27,989 INFO L82 PathProgramCache]: Analyzing trace with hash 933972, now seen corresponding path program 1 times [2019-02-25 15:55:27,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:27,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:27,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:27,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:27,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:28,084 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-25 15:55:28,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:28,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:28,085 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:55:28,085 INFO L207 CegarAbsIntRunner]: [0], [10], [26], [35] [2019-02-25 15:55:28,086 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:28,086 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:28,313 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:28,313 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-25 15:55:28,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:28,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:28,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:28,314 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-25 15:55:28,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:28,322 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:28,327 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:55:28,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:28,333 INFO L467 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 27 treesize of output 30 [2019-02-25 15:55:28,344 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,344 INFO L467 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 30 treesize of output 36 [2019-02-25 15:55:28,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,356 INFO L467 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 32 treesize of output 46 [2019-02-25 15:55:28,361 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,363 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,365 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,366 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:55:28,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,375 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,377 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,378 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:55:28,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,401 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:55:28,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,410 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,410 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,411 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,412 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:55:28,424 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:55:28,425 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,484 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,530 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,575 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,608 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,636 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,662 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,680 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,764 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:55:28,765 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,788 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,811 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,837 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,862 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,900 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,960 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:29,031 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:29,032 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:55:29,080 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:29,081 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:29,082 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:29,146 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:29,146 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:55:29,170 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:29,171 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:29,172 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:29,173 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:29,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:29,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:29,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:29,177 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:29,178 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:55:29,179 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:29,240 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:29,240 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:82 [2019-02-25 15:55:29,261 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-25 15:55:29,261 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:29,282 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-25 15:55:29,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:29,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:55:29,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:29,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:55:29,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:55:29,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:55:29,302 INFO L87 Difference]: Start difference. First operand 103 states and 590 transitions. Second operand 8 states. [2019-02-25 15:55:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:32,121 INFO L93 Difference]: Finished difference Result 145 states and 646 transitions. [2019-02-25 15:55:32,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:55:32,122 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:55:32,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:32,124 INFO L225 Difference]: With dead ends: 145 [2019-02-25 15:55:32,124 INFO L226 Difference]: Without dead ends: 143 [2019-02-25 15:55:32,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:55:32,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-02-25 15:55:32,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 104. [2019-02-25 15:55:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-25 15:55:32,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 599 transitions. [2019-02-25 15:55:32,145 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 599 transitions. Word has length 4 [2019-02-25 15:55:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:32,146 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 599 transitions. [2019-02-25 15:55:32,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:55:32,146 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 599 transitions. [2019-02-25 15:55:32,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:55:32,147 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:32,147 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:55:32,147 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:32,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:32,147 INFO L82 PathProgramCache]: Analyzing trace with hash 938128, now seen corresponding path program 1 times [2019-02-25 15:55:32,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:32,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:32,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:32,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:32,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:32,209 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-25 15:55:32,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:32,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:32,209 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:55:32,210 INFO L207 CegarAbsIntRunner]: [0], [14], [36], [37] [2019-02-25 15:55:32,210 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:32,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:32,397 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:32,398 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-25 15:55:32,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:32,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:32,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:32,398 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-25 15:55:32,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:32,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:32,430 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:55:32,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:32,447 INFO L467 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 27 treesize of output 30 [2019-02-25 15:55:32,492 INFO L467 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 30 treesize of output 32 [2019-02-25 15:55:32,543 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:32,566 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:32,567 INFO L467 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 32 treesize of output 42 [2019-02-25 15:55:32,625 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:32,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:32,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:32,672 INFO L292 Elim1Store]: Index analysis took 104 ms [2019-02-25 15:55:32,672 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 56 [2019-02-25 15:55:32,714 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:32,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:32,762 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:32,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:32,786 INFO L292 Elim1Store]: Index analysis took 112 ms [2019-02-25 15:55:32,787 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-02-25 15:55:32,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:32,851 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:32,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:32,911 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:32,923 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:32,923 INFO L292 Elim1Store]: Index analysis took 134 ms [2019-02-25 15:55:32,925 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 96 [2019-02-25 15:55:32,965 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:32,990 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:33,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:33,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:33,088 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:33,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:33,113 INFO L292 Elim1Store]: Index analysis took 186 ms [2019-02-25 15:55:33,115 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 122 [2019-02-25 15:55:33,301 INFO L292 Elim1Store]: Index analysis took 183 ms [2019-02-25 15:55:33,303 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 121 [2019-02-25 15:55:33,304 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:34,029 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:34,216 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:34,253 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:34,280 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:34,303 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:34,322 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:34,340 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:34,410 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:55:34,410 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:34,427 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:34,441 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:34,459 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:34,487 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:34,529 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:34,595 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:34,596 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:113, output treesize:121 [2019-02-25 15:55:34,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:34,630 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 116 [2019-02-25 15:55:34,630 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:34,689 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:34,689 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:126, output treesize:92 [2019-02-25 15:55:34,737 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-25 15:55:34,737 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:34,749 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-25 15:55:34,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:34,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:55:34,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:34,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:55:34,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:55:34,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:55:34,768 INFO L87 Difference]: Start difference. First operand 104 states and 599 transitions. Second operand 6 states. [2019-02-25 15:55:35,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:35,310 INFO L93 Difference]: Finished difference Result 124 states and 613 transitions. [2019-02-25 15:55:35,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:55:35,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:55:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:35,312 INFO L225 Difference]: With dead ends: 124 [2019-02-25 15:55:35,312 INFO L226 Difference]: Without dead ends: 123 [2019-02-25 15:55:35,312 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-25 15:55:35,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-25 15:55:35,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2019-02-25 15:55:35,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-25 15:55:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 598 transitions. [2019-02-25 15:55:35,330 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 598 transitions. Word has length 4 [2019-02-25 15:55:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:35,331 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 598 transitions. [2019-02-25 15:55:35,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:55:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 598 transitions. [2019-02-25 15:55:35,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:55:35,331 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:35,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:55:35,331 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash 937816, now seen corresponding path program 1 times [2019-02-25 15:55:35,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:35,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:35,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:35,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:35,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:35,480 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 16 [2019-02-25 15:55:35,510 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-25 15:55:35,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:35,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:35,511 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:55:35,511 INFO L207 CegarAbsIntRunner]: [0], [14], [26], [35] [2019-02-25 15:55:35,512 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:35,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:35,807 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:35,807 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-25 15:55:35,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:35,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:35,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:35,808 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-25 15:55:35,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:35,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:35,847 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:55:35,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:35,865 INFO L467 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 27 treesize of output 30 [2019-02-25 15:55:35,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,904 INFO L467 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 30 treesize of output 36 [2019-02-25 15:55:35,942 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,953 INFO L467 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 32 treesize of output 46 [2019-02-25 15:55:35,959 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,963 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,963 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:55:35,968 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,973 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:55:35,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,980 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,984 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:55:35,993 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,994 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,996 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,998 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,001 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:55:36,015 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:55:36,016 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,076 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,123 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,159 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,203 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,228 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,249 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,263 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,339 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:55:36,340 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,364 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,383 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,407 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,437 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,479 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,524 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,595 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:36,595 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:55:36,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,677 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:36,678 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,741 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:36,741 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:55:36,772 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,773 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,781 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:36,782 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,844 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:36,844 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:76 [2019-02-25 15:55:36,867 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-25 15:55:36,867 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:36,919 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-25 15:55:36,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:36,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:55:36,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:36,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:55:36,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:55:36,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:55:36,940 INFO L87 Difference]: Start difference. First operand 104 states and 598 transitions. Second operand 8 states. [2019-02-25 15:55:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:37,851 INFO L93 Difference]: Finished difference Result 176 states and 800 transitions. [2019-02-25 15:55:37,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:55:37,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:55:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:37,854 INFO L225 Difference]: With dead ends: 176 [2019-02-25 15:55:37,854 INFO L226 Difference]: Without dead ends: 174 [2019-02-25 15:55:37,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:55:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-02-25 15:55:37,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 108. [2019-02-25 15:55:37,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-25 15:55:37,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 670 transitions. [2019-02-25 15:55:37,881 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 670 transitions. Word has length 4 [2019-02-25 15:55:37,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:37,881 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 670 transitions. [2019-02-25 15:55:37,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:55:37,882 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 670 transitions. [2019-02-25 15:55:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:55:37,882 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:37,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:55:37,883 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:37,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:37,883 INFO L82 PathProgramCache]: Analyzing trace with hash 953504, now seen corresponding path program 1 times [2019-02-25 15:55:37,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:37,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:37,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:37,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:37,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:37,957 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-25 15:55:37,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:37,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:37,957 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:55:37,958 INFO L207 CegarAbsIntRunner]: [0], [30], [36], [37] [2019-02-25 15:55:37,958 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:37,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:38,118 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:38,118 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-25 15:55:38,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:38,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:38,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:38,118 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-25 15:55:38,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:38,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:38,132 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:55:38,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:38,194 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:55:38,194 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:38,213 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:38,234 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:38,258 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:38,295 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:38,339 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:38,387 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 27 treesize of output 30 [2019-02-25 15:55:38,398 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-02-25 15:55:38,402 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-02-25 15:55:38,406 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 17 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 56 [2019-02-25 15:55:38,412 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-02-25 15:55:38,417 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 96 [2019-02-25 15:55:38,422 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 122 [2019-02-25 15:55:38,437 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 121 [2019-02-25 15:55:38,437 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:38,489 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:38,528 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:38,559 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:38,582 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:38,602 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:38,618 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:38,635 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:38,704 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:38,704 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:113, output treesize:121 [2019-02-25 15:55:38,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:38,740 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 116 [2019-02-25 15:55:38,740 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:38,823 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:38,823 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:126, output treesize:92 [2019-02-25 15:55:38,877 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-25 15:55:38,877 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:38,887 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-25 15:55:38,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:38,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:55:38,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:38,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:55:38,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:55:38,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:55:38,907 INFO L87 Difference]: Start difference. First operand 108 states and 670 transitions. Second operand 6 states. [2019-02-25 15:55:39,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:39,222 INFO L93 Difference]: Finished difference Result 135 states and 696 transitions. [2019-02-25 15:55:39,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:55:39,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:55:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:39,226 INFO L225 Difference]: With dead ends: 135 [2019-02-25 15:55:39,226 INFO L226 Difference]: Without dead ends: 134 [2019-02-25 15:55:39,226 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-25 15:55:39,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-02-25 15:55:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 108. [2019-02-25 15:55:39,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-25 15:55:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 670 transitions. [2019-02-25 15:55:39,254 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 670 transitions. Word has length 4 [2019-02-25 15:55:39,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:39,254 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 670 transitions. [2019-02-25 15:55:39,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:55:39,254 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 670 transitions. [2019-02-25 15:55:39,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:55:39,255 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:39,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:55:39,255 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:39,256 INFO L82 PathProgramCache]: Analyzing trace with hash 29600478, now seen corresponding path program 1 times [2019-02-25 15:55:39,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:39,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:39,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:39,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:39,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:39,438 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 16 [2019-02-25 15:55:39,535 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-25 15:55:39,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:39,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:39,536 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:55:39,536 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [32], [35] [2019-02-25 15:55:39,537 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:39,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:40,159 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:40,160 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-25 15:55:40,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:40,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:40,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:40,160 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-25 15:55:40,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:40,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:40,174 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:55:40,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:40,182 INFO L467 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 27 treesize of output 30 [2019-02-25 15:55:40,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,190 INFO L467 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 30 treesize of output 36 [2019-02-25 15:55:40,197 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,200 INFO L467 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 32 treesize of output 46 [2019-02-25 15:55:40,208 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,213 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,213 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:55:40,219 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,221 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,223 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,225 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,226 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:55:40,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,242 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,245 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,245 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:55:40,250 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,251 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,252 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,253 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,254 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,255 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,256 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:55:40,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,262 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,263 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,264 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,265 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,266 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,267 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,268 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:55:40,269 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,350 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,397 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,434 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,464 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,487 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,508 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,528 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,620 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:55:40,621 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,654 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,666 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,683 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,713 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,758 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,805 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,870 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,968 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:40,969 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:147, output treesize:153 [2019-02-25 15:55:41,040 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,041 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:55:41,042 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:41,183 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:41,184 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:163, output treesize:125 [2019-02-25 15:55:41,219 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,220 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,221 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,223 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,224 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,225 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,226 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,228 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:41,229 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 155 [2019-02-25 15:55:41,230 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:41,324 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:41,324 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:137, output treesize:107 [2019-02-25 15:55:41,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,374 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,374 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,375 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,377 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,378 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,387 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,388 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,390 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 31 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 157 [2019-02-25 15:55:41,391 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:41,480 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:41,481 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:119, output treesize:89 [2019-02-25 15:55:41,510 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-25 15:55:41,511 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:41,546 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-25 15:55:41,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:41,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:55:41,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:41,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:55:41,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:55:41,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:55:41,566 INFO L87 Difference]: Start difference. First operand 108 states and 670 transitions. Second operand 10 states. [2019-02-25 15:55:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:42,671 INFO L93 Difference]: Finished difference Result 212 states and 968 transitions. [2019-02-25 15:55:42,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:55:42,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:55:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:42,675 INFO L225 Difference]: With dead ends: 212 [2019-02-25 15:55:42,675 INFO L226 Difference]: Without dead ends: 205 [2019-02-25 15:55:42,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:55:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-02-25 15:55:42,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 122. [2019-02-25 15:55:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-25 15:55:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 789 transitions. [2019-02-25 15:55:42,711 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 789 transitions. Word has length 5 [2019-02-25 15:55:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:42,711 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 789 transitions. [2019-02-25 15:55:42,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:55:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 789 transitions. [2019-02-25 15:55:42,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:55:42,712 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:42,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:55:42,713 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:42,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:42,713 INFO L82 PathProgramCache]: Analyzing trace with hash 29600106, now seen corresponding path program 1 times [2019-02-25 15:55:42,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:42,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:42,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:42,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:42,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:43,068 WARN L181 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-02-25 15:55:43,101 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-25 15:55:43,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:43,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:43,101 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:55:43,101 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [32], [35] [2019-02-25 15:55:43,105 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:43,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:43,719 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:43,719 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-25 15:55:43,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:43,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:43,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:43,720 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-25 15:55:43,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:43,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:43,735 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:55:43,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:43,856 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:55:43,856 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:43,893 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:43,919 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:43,959 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:44,012 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:44,075 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:44,151 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:44,234 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:44,320 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:55:44,324 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:55:44,328 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:55:44,332 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:55:44,335 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:55:44,340 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:55:44,344 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:55:44,349 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:55:44,350 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:44,425 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:44,467 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:44,501 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:44,528 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:44,550 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:44,569 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:44,587 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:44,699 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:44,700 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:147, output treesize:153 [2019-02-25 15:55:44,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:44,740 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:55:44,740 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:44,831 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:44,831 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:163, output treesize:125 [2019-02-25 15:55:44,873 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:44,874 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:44,875 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:44,876 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:44,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:44,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:44,880 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:44,881 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:44,882 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:44,883 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 155 [2019-02-25 15:55:44,883 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:44,977 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:44,977 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:137, output treesize:107 [2019-02-25 15:55:45,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:45,009 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:45,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:45,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:45,012 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:45,014 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:45,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:45,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:45,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:45,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:45,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:45,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:45,022 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:45,023 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 157 [2019-02-25 15:55:45,023 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:45,110 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:45,111 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:119, output treesize:97 [2019-02-25 15:55:45,183 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-25 15:55:45,183 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:45,228 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-25 15:55:45,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:45,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:55:45,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:45,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:55:45,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:55:45,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:55:45,249 INFO L87 Difference]: Start difference. First operand 122 states and 789 transitions. Second operand 10 states. [2019-02-25 15:55:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:47,069 INFO L93 Difference]: Finished difference Result 169 states and 850 transitions. [2019-02-25 15:55:47,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:55:47,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:55:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:47,071 INFO L225 Difference]: With dead ends: 169 [2019-02-25 15:55:47,072 INFO L226 Difference]: Without dead ends: 168 [2019-02-25 15:55:47,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:55:47,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-02-25 15:55:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 119. [2019-02-25 15:55:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-25 15:55:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 762 transitions. [2019-02-25 15:55:47,106 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 762 transitions. Word has length 5 [2019-02-25 15:55:47,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:47,106 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 762 transitions. [2019-02-25 15:55:47,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:55:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 762 transitions. [2019-02-25 15:55:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:55:47,107 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:47,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:55:47,107 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:47,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:47,107 INFO L82 PathProgramCache]: Analyzing trace with hash 29600602, now seen corresponding path program 1 times [2019-02-25 15:55:47,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:47,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:47,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:47,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:47,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:47,250 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-25 15:55:47,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:47,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:47,251 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:55:47,252 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [32], [35] [2019-02-25 15:55:47,253 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:47,253 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:47,908 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:47,908 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-25 15:55:47,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:47,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:47,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:47,908 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-25 15:55:47,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:47,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:47,924 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:55:47,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:48,006 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:55:48,007 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,043 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,055 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,076 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,104 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,146 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,193 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,260 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,336 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:55:48,340 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:55:48,344 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:55:48,348 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:55:48,352 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:55:48,357 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:55:48,362 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:55:48,367 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-25 15:55:48,367 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,443 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,488 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,522 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,550 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,573 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,592 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,609 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,707 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:48,708 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:147, output treesize:153 [2019-02-25 15:55:48,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:48,752 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:55:48,752 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,844 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:48,845 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:163, output treesize:125 [2019-02-25 15:55:48,882 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:48,883 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:48,884 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:48,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:48,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:48,887 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:48,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:48,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:48,890 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:48,891 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 155 [2019-02-25 15:55:48,892 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,982 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:48,983 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:137, output treesize:107 [2019-02-25 15:55:49,032 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:49,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:49,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:49,038 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:49,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:49,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:49,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:49,043 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:49,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:49,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:49,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:49,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:49,048 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:49,049 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 157 [2019-02-25 15:55:49,050 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:49,142 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:49,142 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:119, output treesize:97 [2019-02-25 15:55:49,210 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-25 15:55:49,210 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:49,254 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-25 15:55:49,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:49,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:55:49,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:49,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:55:49,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:55:49,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:55:49,273 INFO L87 Difference]: Start difference. First operand 119 states and 762 transitions. Second operand 10 states. [2019-02-25 15:55:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:50,802 INFO L93 Difference]: Finished difference Result 176 states and 845 transitions. [2019-02-25 15:55:50,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:55:50,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:55:50,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:50,805 INFO L225 Difference]: With dead ends: 176 [2019-02-25 15:55:50,805 INFO L226 Difference]: Without dead ends: 172 [2019-02-25 15:55:50,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:55:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-02-25 15:55:50,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 125. [2019-02-25 15:55:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-25 15:55:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 788 transitions. [2019-02-25 15:55:50,837 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 788 transitions. Word has length 5 [2019-02-25 15:55:50,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:50,837 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 788 transitions. [2019-02-25 15:55:50,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:55:50,837 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 788 transitions. [2019-02-25 15:55:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:55:50,838 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:50,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:55:50,838 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:50,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:50,838 INFO L82 PathProgramCache]: Analyzing trace with hash 29588822, now seen corresponding path program 1 times [2019-02-25 15:55:50,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:50,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:50,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:50,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:50,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:51,011 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2019-02-25 15:55:51,055 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-25 15:55:51,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:51,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:51,056 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:55:51,056 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [32], [35] [2019-02-25 15:55:51,057 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:51,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:51,722 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:51,722 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-25 15:55:51,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:51,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:51,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:51,723 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-25 15:55:51,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:51,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:51,738 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:55:51,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:51,802 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:55:51,802 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:51,834 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:51,853 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:51,873 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:51,901 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:51,960 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,008 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,061 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-25 15:55:52,065 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-02-25 15:55:52,069 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-02-25 15:55:52,072 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-02-25 15:55:52,075 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-25 15:55:52,079 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-02-25 15:55:52,084 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-02-25 15:55:52,094 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 125 [2019-02-25 15:55:52,095 INFO L301 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,150 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,193 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,225 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,252 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,273 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,292 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,307 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,380 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:52,380 INFO L208 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-02-25 15:55:52,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,480 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 14 case distinctions, treesize of input 51 treesize of output 153 [2019-02-25 15:55:52,481 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-02-25 15:55:52,514 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 128 xjuncts. [2019-02-25 15:55:54,055 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 41 dim-0 vars, and 8 xjuncts. [2019-02-25 15:55:54,055 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:135, output treesize:918 [2019-02-25 15:55:54,802 WARN L181 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 463 DAG size of output: 183 [2019-02-25 15:55:54,811 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,813 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 162 [2019-02-25 15:55:54,814 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:55,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,121 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,144 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,153 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,155 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,155 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:55,156 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 144 [2019-02-25 15:55:55,156 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:55,366 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,367 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,367 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,369 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,370 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,371 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,373 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 122 [2019-02-25 15:55:55,374 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:55,564 INFO L301 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 3 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2019-02-25 15:55:55,564 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 18 variables, input treesize:373, output treesize:277 [2019-02-25 15:55:55,753 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,753 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,754 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,755 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,756 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,758 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,759 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,761 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,762 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,764 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,765 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,765 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:55,766 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 138 [2019-02-25 15:55:55,767 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:55,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:55,974 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 156 [2019-02-25 15:55:55,975 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:56,153 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:56,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:56,156 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:56,157 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:56,158 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:56,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:56,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:56,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:56,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:56,164 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:56,165 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:56,166 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:56,167 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:56,168 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:56,169 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 27 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 120 [2019-02-25 15:55:56,170 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:56,324 INFO L301 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 3 dim-1 vars, End of recursive call: 18 dim-0 vars, and 3 xjuncts. [2019-02-25 15:55:56,324 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 21 variables, input treesize:307, output treesize:239 [2019-02-25 15:55:56,738 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:55:56,740 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-25 15:55:56,740 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:56,764 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-25 15:55:56,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:56,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-25 15:55:56,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:56,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:55:56,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:55:56,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:55:56,785 INFO L87 Difference]: Start difference. First operand 125 states and 788 transitions. Second operand 10 states. [2019-02-25 15:55:57,156 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 131 [2019-02-25 15:56:10,643 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-25 15:56:10,644 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:652) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:256) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:715) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2019-02-25 15:56:10,648 INFO L168 Benchmark]: Toolchain (without parser) took 157805.08 ms. Allocated memory was 140.5 MB in the beginning and 796.9 MB in the end (delta: 656.4 MB). Free memory was 108.1 MB in the beginning and 543.3 MB in the end (delta: -435.2 MB). Peak memory consumption was 221.2 MB. Max. memory is 7.1 GB. [2019-02-25 15:56:10,649 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory is still 109.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:56:10,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.89 ms. Allocated memory is still 140.5 MB. Free memory was 107.9 MB in the beginning and 105.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:56:10,649 INFO L168 Benchmark]: Boogie Preprocessor took 25.72 ms. Allocated memory is still 140.5 MB. Free memory was 105.6 MB in the beginning and 104.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:56:10,649 INFO L168 Benchmark]: RCFGBuilder took 564.45 ms. Allocated memory is still 140.5 MB. Free memory was 104.1 MB in the beginning and 91.3 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2019-02-25 15:56:10,649 INFO L168 Benchmark]: TraceAbstraction took 157154.99 ms. Allocated memory was 140.5 MB in the beginning and 796.9 MB in the end (delta: 656.4 MB). Free memory was 91.1 MB in the beginning and 543.3 MB in the end (delta: -452.2 MB). Peak memory consumption was 204.2 MB. Max. memory is 7.1 GB. [2019-02-25 15:56:10,651 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory is still 109.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.89 ms. Allocated memory is still 140.5 MB. Free memory was 107.9 MB in the beginning and 105.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.72 ms. Allocated memory is still 140.5 MB. Free memory was 105.6 MB in the beginning and 104.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 564.45 ms. Allocated memory is still 140.5 MB. Free memory was 104.1 MB in the beginning and 91.3 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 157154.99 ms. Allocated memory was 140.5 MB in the beginning and 796.9 MB in the end (delta: 656.4 MB). Free memory was 91.1 MB in the beginning and 543.3 MB in the end (delta: -452.2 MB). Peak memory consumption was 204.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...