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_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 10:57:39,756 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:57:39,758 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:57:39,771 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:57:39,771 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:57:39,772 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:57:39,773 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:57:39,775 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:57:39,777 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:57:39,778 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:57:39,779 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:57:39,779 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:57:39,780 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:57:39,781 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:57:39,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:57:39,783 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:57:39,784 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:57:39,785 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:57:39,787 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:57:39,789 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:57:39,790 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:57:39,791 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:57:39,793 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:57:39,794 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:57:39,794 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:57:39,795 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:57:39,796 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:57:39,797 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:57:39,797 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:57:39,799 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:57:39,799 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:57:39,799 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:57:39,800 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:57:39,800 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:57:39,801 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:57:39,802 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:57:39,802 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-15 10:57:39,827 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:57:39,827 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:57:39,830 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:57:39,830 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:57:39,831 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:57:39,831 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:57:39,831 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:57:39,831 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:57:39,831 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:57:39,832 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:57:39,832 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:57:39,832 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:57:39,832 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:57:39,832 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:57:39,834 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:57:39,834 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:57:39,834 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:57:39,834 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:57:39,835 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:57:39,836 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:57:39,837 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:57:39,837 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:57:39,837 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:57:39,837 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:57:39,837 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:57:39,837 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:57:39,838 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:57:39,838 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:57:39,838 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:57:39,838 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:57:39,838 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:57:39,839 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:57:39,839 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:57:39,839 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:57:39,839 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:57:39,839 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:57:39,840 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:57:39,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:57:39,841 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:57:39,841 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:57:39,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:57:39,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:57:39,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:57:39,891 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:57:39,891 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:57:39,892 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl [2019-02-15 10:57:39,892 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl' [2019-02-15 10:57:39,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:57:39,928 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:57:39,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:57:39,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:57:39,929 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:57:39,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:39" (1/1) ... [2019-02-15 10:57:39,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:39" (1/1) ... [2019-02-15 10:57:39,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:57:39,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:57:39,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:57:39,988 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:57:39,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:39" (1/1) ... [2019-02-15 10:57:40,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:39" (1/1) ... [2019-02-15 10:57:40,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:39" (1/1) ... [2019-02-15 10:57:40,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:39" (1/1) ... [2019-02-15 10:57:40,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:39" (1/1) ... [2019-02-15 10:57:40,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:39" (1/1) ... [2019-02-15 10:57:40,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:39" (1/1) ... [2019-02-15 10:57:40,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:57:40,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:57:40,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:57:40,032 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:57:40,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:57:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 10:57:40,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 10:57:40,530 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 10:57:40,531 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-02-15 10:57:40,532 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:57:40 BoogieIcfgContainer [2019-02-15 10:57:40,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:57:40,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:57:40,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:57:40,537 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:57:40,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:39" (1/2) ... [2019-02-15 10:57:40,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d906be9 and model type speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:57:40, skipping insertion in model container [2019-02-15 10:57:40,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:57:40" (2/2) ... [2019-02-15 10:57:40,540 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-unlimited.bpl [2019-02-15 10:57:40,549 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:57:40,557 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-02-15 10:57:40,569 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-02-15 10:57:40,598 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:57:40,599 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:57:40,599 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:57:40,599 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:57:40,599 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:57:40,600 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:57:40,600 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:57:40,600 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:57:40,615 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-02-15 10:57:40,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-15 10:57:40,621 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:40,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-15 10:57:40,624 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:40,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:40,629 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-02-15 10:57:40,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:40,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:40,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:40,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:40,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:40,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:57:40,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:57:40,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:57:40,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:57:40,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:57:40,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:57:40,857 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-02-15 10:57:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:41,114 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-02-15 10:57:41,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:57:41,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-15 10:57:41,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:41,130 INFO L225 Difference]: With dead ends: 33 [2019-02-15 10:57:41,130 INFO L226 Difference]: Without dead ends: 28 [2019-02-15 10:57:41,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:57:41,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-15 10:57:41,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-02-15 10:57:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-15 10:57:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-02-15 10:57:41,164 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-02-15 10:57:41,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:41,166 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-02-15 10:57:41,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:57:41,166 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-02-15 10:57:41,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:57:41,167 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:41,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:57:41,167 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:41,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:41,168 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-02-15 10:57:41,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:41,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:41,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:41,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:41,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:41,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:57:41,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:57:41,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:57:41,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:57:41,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:57:41,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:57:41,249 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-02-15 10:57:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:41,569 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-02-15 10:57:41,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:57:41,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 10:57:41,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:41,571 INFO L225 Difference]: With dead ends: 28 [2019-02-15 10:57:41,572 INFO L226 Difference]: Without dead ends: 27 [2019-02-15 10:57:41,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:57:41,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-15 10:57:41,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-02-15 10:57:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 10:57:41,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-02-15 10:57:41,577 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-02-15 10:57:41,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:41,578 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-02-15 10:57:41,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:57:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-02-15 10:57:41,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:57:41,579 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:41,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:57:41,579 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:41,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:41,580 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-02-15 10:57:41,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:41,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:41,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:41,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:41,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:41,727 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:57:41,728 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-02-15 10:57:41,766 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:41,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:41,863 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:41,866 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 2. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:41,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:41,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:41,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:41,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:41,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:41,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:41,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:42,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:57:42,282 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-02-15 10:57:42,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:57:42,452 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-02-15 10:57:42,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:57:42,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:57:43,078 WARN L181 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-02-15 10:57:43,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:57:43,120 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,185 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,279 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,485 INFO L478 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 24 treesize of output 27 [2019-02-15 10:57:43,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:57:43,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:57:43,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:57:43,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:57:43,536 INFO L478 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 35 treesize of output 97 [2019-02-15 10:57:43,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:57:43,568 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,717 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,796 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,841 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,875 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,893 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,910 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:43,989 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 10:57:44,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:57:44,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,194 INFO L267 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-15 10:57:44,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 10:57:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:44,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:44,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:44,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:57:44,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:44,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:57:44,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:57:44,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:44,310 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2019-02-15 10:57:44,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:44,724 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-02-15 10:57:44,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:57:44,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:57:44,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:44,726 INFO L225 Difference]: With dead ends: 54 [2019-02-15 10:57:44,727 INFO L226 Difference]: Without dead ends: 52 [2019-02-15 10:57:44,727 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-15 10:57:44,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-15 10:57:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2019-02-15 10:57:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-15 10:57:44,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2019-02-15 10:57:44,734 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 3 [2019-02-15 10:57:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:44,734 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2019-02-15 10:57:44,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:57:44,735 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-02-15 10:57:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:57:44,735 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:44,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:57:44,736 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:44,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:44,736 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2019-02-15 10:57:44,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:44,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:44,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:44,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:44,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:44,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:44,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:44,800 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:57:44,800 INFO L207 CegarAbsIntRunner]: [0], [6], [31] [2019-02-15 10:57:44,802 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:44,802 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:44,810 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:44,810 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 2. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:44,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:44,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:44,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:44,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:44,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:44,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:44,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:44,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:57:44,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:57:44,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:57:44,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:57:44,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,965 INFO L478 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 33 treesize of output 75 [2019-02-15 10:57:45,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,024 INFO L478 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 35 treesize of output 97 [2019-02-15 10:57:45,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:57:45,059 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,102 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,168 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,195 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,229 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:57:45,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:57:45,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:57:45,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:57:45,698 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-02-15 10:57:45,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:57:45,768 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,794 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,820 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,847 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,883 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,935 INFO L267 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-15 10:57:45,935 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:95, output treesize:96 [2019-02-15 10:57:46,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:57:46,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:46,141 INFO L267 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-15 10:57:46,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 10:57:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:46,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:46,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:57:46,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 10:57:46,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:57:46,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:57:46,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:57:46,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:57:46,182 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 4 states. [2019-02-15 10:57:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:46,265 INFO L93 Difference]: Finished difference Result 25 states and 67 transitions. [2019-02-15 10:57:46,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:57:46,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 10:57:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:46,267 INFO L225 Difference]: With dead ends: 25 [2019-02-15 10:57:46,267 INFO L226 Difference]: Without dead ends: 24 [2019-02-15 10:57:46,268 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-15 10:57:46,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-15 10:57:46,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-02-15 10:57:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-15 10:57:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-02-15 10:57:46,275 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 3 [2019-02-15 10:57:46,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:46,276 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-02-15 10:57:46,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:57:46,276 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-02-15 10:57:46,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:57:46,276 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:46,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:57:46,277 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:46,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:46,277 INFO L82 PathProgramCache]: Analyzing trace with hash 30132, now seen corresponding path program 1 times [2019-02-15 10:57:46,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:46,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:46,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:46,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:46,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:46,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:46,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:46,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:46,389 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:57:46,389 INFO L207 CegarAbsIntRunner]: [0], [10], [31] [2019-02-15 10:57:46,391 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:46,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:46,398 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:46,398 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 2. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:46,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:46,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:46,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:46,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:46,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:46,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:46,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:46,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:57:46,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:57:46,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:57:46,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:57:46,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,708 INFO L478 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 33 treesize of output 75 [2019-02-15 10:57:46,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,773 INFO L478 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 35 treesize of output 97 [2019-02-15 10:57:46,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:57:46,790 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:46,875 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:46,908 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:46,933 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:46,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:46,971 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:46,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:47,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:57:47,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:57:47,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:57:47,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:57:47,501 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-02-15 10:57:47,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:57:47,517 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:47,544 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:47,571 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:47,597 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:47,631 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:47,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:47,684 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 10:57:47,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:57:47,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:47,888 INFO L267 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-15 10:57:47,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 10:57:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:47,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:47,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:47,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:57:47,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:47,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:57:47,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:57:47,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:47,949 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 6 states. [2019-02-15 10:57:48,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:48,288 INFO L93 Difference]: Finished difference Result 57 states and 111 transitions. [2019-02-15 10:57:48,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:57:48,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:57:48,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:48,291 INFO L225 Difference]: With dead ends: 57 [2019-02-15 10:57:48,291 INFO L226 Difference]: Without dead ends: 56 [2019-02-15 10:57:48,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:57:48,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-15 10:57:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 25. [2019-02-15 10:57:48,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-15 10:57:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2019-02-15 10:57:48,300 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 82 transitions. Word has length 3 [2019-02-15 10:57:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:48,300 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 82 transitions. [2019-02-15 10:57:48,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:57:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 82 transitions. [2019-02-15 10:57:48,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:57:48,301 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:48,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:57:48,301 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:48,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:48,301 INFO L82 PathProgramCache]: Analyzing trace with hash 30628, now seen corresponding path program 1 times [2019-02-15 10:57:48,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:48,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:48,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:48,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:48,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:48,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:48,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:48,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:48,379 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:57:48,380 INFO L207 CegarAbsIntRunner]: [0], [26], [31] [2019-02-15 10:57:48,381 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:48,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:48,388 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:48,388 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 2. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:48,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:48,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:48,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:48,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:48,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:48,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:48,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:48,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:57:48,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:57:48,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:57:48,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:57:48,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,486 INFO L478 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 33 treesize of output 75 [2019-02-15 10:57:48,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,506 INFO L478 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 35 treesize of output 97 [2019-02-15 10:57:48,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:57:48,524 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,565 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,601 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,628 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,647 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,663 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:57:48,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:57:48,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:57:48,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:57:48,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:57:48,986 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:49,012 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:49,039 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:49,067 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:49,096 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:49,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:49,147 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 10:57:49,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:49,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:57:49,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:49,279 INFO L267 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-15 10:57:49,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 10:57:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:49,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:49,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:49,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:57:49,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:49,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:57:49,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:57:49,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:49,374 INFO L87 Difference]: Start difference. First operand 25 states and 82 transitions. Second operand 6 states. [2019-02-15 10:57:49,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:49,777 INFO L93 Difference]: Finished difference Result 59 states and 127 transitions. [2019-02-15 10:57:49,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:57:49,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:57:49,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:49,782 INFO L225 Difference]: With dead ends: 59 [2019-02-15 10:57:49,782 INFO L226 Difference]: Without dead ends: 57 [2019-02-15 10:57:49,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:57:49,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-15 10:57:49,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-02-15 10:57:49,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-15 10:57:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2019-02-15 10:57:49,801 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 101 transitions. Word has length 3 [2019-02-15 10:57:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:49,801 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 101 transitions. [2019-02-15 10:57:49,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:57:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 101 transitions. [2019-02-15 10:57:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:49,803 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:49,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:49,803 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:49,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:49,803 INFO L82 PathProgramCache]: Analyzing trace with hash 955362, now seen corresponding path program 1 times [2019-02-15 10:57:49,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:49,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:49,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:49,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:49,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:49,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:57:49,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 10:57:49,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:57:49,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:57:49,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:57:49,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-15 10:57:49,929 INFO L87 Difference]: Start difference. First operand 29 states and 101 transitions. Second operand 4 states. [2019-02-15 10:57:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:50,055 INFO L93 Difference]: Finished difference Result 37 states and 114 transitions. [2019-02-15 10:57:50,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:57:50,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 10:57:50,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:50,056 INFO L225 Difference]: With dead ends: 37 [2019-02-15 10:57:50,057 INFO L226 Difference]: Without dead ends: 36 [2019-02-15 10:57:50,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-15 10:57:50,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-15 10:57:50,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2019-02-15 10:57:50,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-15 10:57:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 111 transitions. [2019-02-15 10:57:50,066 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 111 transitions. Word has length 4 [2019-02-15 10:57:50,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:50,066 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 111 transitions. [2019-02-15 10:57:50,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:57:50,066 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 111 transitions. [2019-02-15 10:57:50,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:50,067 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:50,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:50,068 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:50,068 INFO L82 PathProgramCache]: Analyzing trace with hash 941844, now seen corresponding path program 1 times [2019-02-15 10:57:50,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:50,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:50,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:50,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:50,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:50,192 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:50,193 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [33] [2019-02-15 10:57:50,194 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:50,194 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:50,204 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:50,204 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:50,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:50,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:50,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:50,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:50,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:50,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:50,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:50,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:57:50,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:57:50,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:57:50,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:57:50,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:57:50,497 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,523 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,579 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,647 INFO L478 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 24 treesize of output 27 [2019-02-15 10:57:50,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:57:50,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:57:50,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:57:50,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:57:50,684 INFO L478 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 35 treesize of output 97 [2019-02-15 10:57:50,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:57:50,731 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,772 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,803 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,826 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,845 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,861 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,876 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:51,218 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 10:57:51,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:57:51,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,307 INFO L267 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-15 10:57:51,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 10:57:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:51,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:51,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:57:51,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 10:57:51,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:57:51,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:57:51,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:57:51,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:57:51,357 INFO L87 Difference]: Start difference. First operand 32 states and 111 transitions. Second operand 4 states. [2019-02-15 10:57:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:51,476 INFO L93 Difference]: Finished difference Result 36 states and 122 transitions. [2019-02-15 10:57:51,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:57:51,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 10:57:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:51,478 INFO L225 Difference]: With dead ends: 36 [2019-02-15 10:57:51,478 INFO L226 Difference]: Without dead ends: 35 [2019-02-15 10:57:51,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-15 10:57:51,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-15 10:57:51,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-02-15 10:57:51,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-15 10:57:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 121 transitions. [2019-02-15 10:57:51,486 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 121 transitions. Word has length 4 [2019-02-15 10:57:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:51,486 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 121 transitions. [2019-02-15 10:57:51,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:57:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 121 transitions. [2019-02-15 10:57:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:51,487 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:51,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:51,488 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:51,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:51,488 INFO L82 PathProgramCache]: Analyzing trace with hash 941532, now seen corresponding path program 1 times [2019-02-15 10:57:51,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:51,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:51,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:51,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:51,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:51,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:51,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:51,663 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:51,663 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [31] [2019-02-15 10:57:51,664 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:51,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:51,669 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:51,670 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:51,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:51,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:51,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:51,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:51,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:51,679 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:51,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:51,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:57:51,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:57:51,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:57:51,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:57:51,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,742 INFO L478 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 33 treesize of output 75 [2019-02-15 10:57:51,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,760 INFO L478 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 35 treesize of output 97 [2019-02-15 10:57:51,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:57:51,776 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,817 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,850 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,876 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:57:52,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:57:52,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:57:52,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:57:52,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:57:52,206 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,234 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,263 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,289 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,317 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,368 INFO L267 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-15 10:57:52,369 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 10:57:52,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:57:52,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:52,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:52,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:57:52,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-02-15 10:57:52,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:53,109 INFO L267 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-15 10:57:53,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-15 10:57:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:53,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:53,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:53,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:53,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:53,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:53,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:53,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:53,179 INFO L87 Difference]: Start difference. First operand 34 states and 121 transitions. Second operand 8 states. [2019-02-15 10:57:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:53,732 INFO L93 Difference]: Finished difference Result 79 states and 193 transitions. [2019-02-15 10:57:53,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:53,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:53,734 INFO L225 Difference]: With dead ends: 79 [2019-02-15 10:57:53,734 INFO L226 Difference]: Without dead ends: 77 [2019-02-15 10:57:53,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:53,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-15 10:57:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 41. [2019-02-15 10:57:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 10:57:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-15 10:57:53,744 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-02-15 10:57:53,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:53,744 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-15 10:57:53,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:53,744 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-15 10:57:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:53,745 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:53,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:53,745 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:53,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:53,746 INFO L82 PathProgramCache]: Analyzing trace with hash 941160, now seen corresponding path program 1 times [2019-02-15 10:57:53,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:53,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:53,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:53,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:53,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:53,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:53,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:53,862 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:53,863 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [31] [2019-02-15 10:57:53,864 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:53,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:53,871 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:53,871 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:53,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:53,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:53,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:53,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:53,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:53,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:53,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:54,093 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 10:57:54,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:57:54,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:57:54,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:57:54,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:57:54,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,151 INFO L478 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 33 treesize of output 75 [2019-02-15 10:57:54,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,160 INFO L478 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 35 treesize of output 97 [2019-02-15 10:57:54,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:57:54,179 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,222 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,256 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,286 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,310 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,328 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:57:54,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:57:54,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:57:54,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:57:54,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:57:54,650 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,694 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,726 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,763 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,801 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,864 INFO L267 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-15 10:57:54,865 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 10:57:55,205 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-02-15 10:57:55,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:57:55,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:55,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:55,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:57:55,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,299 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:55,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-02-15 10:57:55,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:55,348 INFO L267 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-15 10:57:55,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-02-15 10:57:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:55,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:55,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:55,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:55,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:55,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:55,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:55,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:55,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:55,435 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-02-15 10:57:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:55,944 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-02-15 10:57:55,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:55,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:55,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:55,946 INFO L225 Difference]: With dead ends: 74 [2019-02-15 10:57:55,946 INFO L226 Difference]: Without dead ends: 73 [2019-02-15 10:57:55,947 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-15 10:57:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-15 10:57:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2019-02-15 10:57:55,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 10:57:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-15 10:57:55,956 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-02-15 10:57:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:55,957 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-15 10:57:55,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-15 10:57:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:55,958 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:55,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:55,958 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:55,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:55,958 INFO L82 PathProgramCache]: Analyzing trace with hash 941656, now seen corresponding path program 1 times [2019-02-15 10:57:55,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:55,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:55,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:55,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:55,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:56,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:56,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:56,036 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:56,037 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [31] [2019-02-15 10:57:56,038 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:56,038 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:56,043 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:56,043 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:56,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:56,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:56,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:56,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:56,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:56,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:56,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:56,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:57:56,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:57:56,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:57:56,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:57:56,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:57:56,322 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,353 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,526 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,592 INFO L478 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 24 treesize of output 27 [2019-02-15 10:57:56,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:57:56,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:57:56,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:57:56,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:57:56,610 INFO L478 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 35 treesize of output 97 [2019-02-15 10:57:56,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:57:56,679 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,724 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,753 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,781 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,799 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,815 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,838 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,944 INFO L267 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-15 10:57:56,947 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 10:57:57,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:57:57,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:57,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:57,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:57:57,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,284 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:57,284 INFO L303 Elim1Store]: Index analysis took 140 ms [2019-02-15 10:57:57,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-02-15 10:57:57,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:57,342 INFO L267 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-15 10:57:57,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-02-15 10:57:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:57,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:57,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:57,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:57,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:57,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:57,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:57,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:57,441 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-02-15 10:57:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:57,951 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-02-15 10:57:57,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:57,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:57,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:57,952 INFO L225 Difference]: With dead ends: 74 [2019-02-15 10:57:57,952 INFO L226 Difference]: Without dead ends: 72 [2019-02-15 10:57:57,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:57:57,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-15 10:57:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 40. [2019-02-15 10:57:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-15 10:57:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 149 transitions. [2019-02-15 10:57:57,962 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 149 transitions. Word has length 4 [2019-02-15 10:57:57,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:57,962 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 149 transitions. [2019-02-15 10:57:57,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 149 transitions. [2019-02-15 10:57:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:57,963 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:57,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:57,963 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:57,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:57,964 INFO L82 PathProgramCache]: Analyzing trace with hash 941718, now seen corresponding path program 1 times [2019-02-15 10:57:57,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:57,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:57,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:57,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:57,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:58,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:58,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:58,086 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:58,086 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [31] [2019-02-15 10:57:58,087 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:58,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:58,092 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:58,092 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:58,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:58,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:58,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:58,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:58,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:58,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:58,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:58,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:57:58,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:57:58,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:57:58,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:57:58,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,176 INFO L478 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 33 treesize of output 75 [2019-02-15 10:57:58,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,202 INFO L478 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 35 treesize of output 97 [2019-02-15 10:57:58,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:57:58,257 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:58,298 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:58,331 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:58,358 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:58,380 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:58,396 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:58,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:58,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:57:58,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:57:58,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:57:58,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:57:58,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:57:58,670 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:58,696 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:58,721 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:58,748 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:58,774 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:58,830 INFO L267 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-15 10:57:58,830 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 10:57:58,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-15 10:57:58,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:57:59,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-15 10:57:59,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:150 [2019-02-15 10:57:59,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,133 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:59,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 97 [2019-02-15 10:57:59,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:59,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 142 [2019-02-15 10:57:59,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 32 xjuncts. [2019-02-15 10:58:00,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 36 dim-0 vars, and 7 xjuncts. [2019-02-15 10:58:00,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:172, output treesize:455 [2019-02-15 10:58:00,823 WARN L181 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 121 [2019-02-15 10:58:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:00,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:00,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:00,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:58:00,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:00,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:00,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:00,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:58:00,878 INFO L87 Difference]: Start difference. First operand 40 states and 149 transitions. Second operand 8 states. [2019-02-15 10:58:01,321 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-02-15 10:58:12,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:12,283 INFO L93 Difference]: Finished difference Result 79 states and 233 transitions. [2019-02-15 10:58:12,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:58:12,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:58:12,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:12,285 INFO L225 Difference]: With dead ends: 79 [2019-02-15 10:58:12,285 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 10:58:12,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:58:12,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 10:58:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 41. [2019-02-15 10:58:12,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 10:58:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 177 transitions. [2019-02-15 10:58:12,296 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 177 transitions. Word has length 4 [2019-02-15 10:58:12,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:12,296 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 177 transitions. [2019-02-15 10:58:12,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:58:12,296 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 177 transitions. [2019-02-15 10:58:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:58:12,297 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:12,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:58:12,297 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:12,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:12,298 INFO L82 PathProgramCache]: Analyzing trace with hash 930312, now seen corresponding path program 1 times [2019-02-15 10:58:12,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:12,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:12,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:12,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:12,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:12,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:58:12,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:58:12,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 10:58:12,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:58:12,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:58:12,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:58:12,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 10:58:12,360 INFO L87 Difference]: Start difference. First operand 41 states and 177 transitions. Second operand 4 states. [2019-02-15 10:58:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:12,465 INFO L93 Difference]: Finished difference Result 53 states and 195 transitions. [2019-02-15 10:58:12,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:58:12,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 10:58:12,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:12,466 INFO L225 Difference]: With dead ends: 53 [2019-02-15 10:58:12,467 INFO L226 Difference]: Without dead ends: 52 [2019-02-15 10:58:12,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 10:58:12,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-15 10:58:12,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-02-15 10:58:12,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-15 10:58:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 186 transitions. [2019-02-15 10:58:12,478 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 186 transitions. Word has length 4 [2019-02-15 10:58:12,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:12,478 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 186 transitions. [2019-02-15 10:58:12,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:58:12,478 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 186 transitions. [2019-02-15 10:58:12,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:58:12,479 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:12,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:58:12,479 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:12,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:12,480 INFO L82 PathProgramCache]: Analyzing trace with hash 929876, now seen corresponding path program 1 times [2019-02-15 10:58:12,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:12,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:12,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:12,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:12,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:12,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:12,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:12,565 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:58:12,566 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [31] [2019-02-15 10:58:12,567 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:12,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:12,572 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:12,572 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:12,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:12,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:12,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:12,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:12,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:12,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:12,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:12,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:12,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:12,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:12,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:12,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:58:12,858 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:12,887 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:12,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:12,942 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:12,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,005 INFO L478 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 24 treesize of output 27 [2019-02-15 10:58:13,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:58:13,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:58:13,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:58:13,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:58:13,024 INFO L478 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 35 treesize of output 97 [2019-02-15 10:58:13,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:58:13,033 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,072 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,103 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,127 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,146 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,161 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,175 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:13,227 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 10:58:13,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:58:13,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:13,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:13,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-02-15 10:58:13,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,404 INFO L267 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-15 10:58:13,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-15 10:58:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:13,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:13,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:13,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:58:13,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:13,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:13,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:13,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:58:13,455 INFO L87 Difference]: Start difference. First operand 43 states and 186 transitions. Second operand 8 states. [2019-02-15 10:58:14,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:14,044 INFO L93 Difference]: Finished difference Result 87 states and 278 transitions. [2019-02-15 10:58:14,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:58:14,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:58:14,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:14,046 INFO L225 Difference]: With dead ends: 87 [2019-02-15 10:58:14,046 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 10:58:14,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:58:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 10:58:14,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 41. [2019-02-15 10:58:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 10:58:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 149 transitions. [2019-02-15 10:58:14,055 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 149 transitions. Word has length 4 [2019-02-15 10:58:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:14,055 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 149 transitions. [2019-02-15 10:58:14,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:58:14,055 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 149 transitions. [2019-02-15 10:58:14,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:58:14,055 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:14,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:58:14,056 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:14,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:14,056 INFO L82 PathProgramCache]: Analyzing trace with hash 945688, now seen corresponding path program 1 times [2019-02-15 10:58:14,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:14,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:14,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:14,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:14,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:14,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:14,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:14,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:14,122 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:58:14,122 INFO L207 CegarAbsIntRunner]: [0], [22], [32], [33] [2019-02-15 10:58:14,123 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:14,123 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:14,128 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:14,128 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:58:14,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:14,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:14,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:14,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:14,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:14,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:14,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:14,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:58:14,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:58:14,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:58:14,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:58:14,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,198 INFO L478 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 33 treesize of output 75 [2019-02-15 10:58:14,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,237 INFO L478 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 35 treesize of output 97 [2019-02-15 10:58:14,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:58:14,305 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:14,344 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:14,376 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:14,415 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:14,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:14,459 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:14,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:14,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:14,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:14,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:14,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:14,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:58:14,797 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:14,822 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:14,848 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:14,875 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:14,902 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:14,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:14,952 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 10:58:15,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:58:15,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:15,151 INFO L267 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-15 10:58:15,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:15,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:15,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:15,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:58:15,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:15,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:58:15,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:58:15,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:58:15,237 INFO L87 Difference]: Start difference. First operand 41 states and 149 transitions. Second operand 6 states. [2019-02-15 10:58:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:15,432 INFO L93 Difference]: Finished difference Result 64 states and 185 transitions. [2019-02-15 10:58:15,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:58:15,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 10:58:15,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:15,434 INFO L225 Difference]: With dead ends: 64 [2019-02-15 10:58:15,434 INFO L226 Difference]: Without dead ends: 63 [2019-02-15 10:58:15,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:58:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-15 10:58:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 42. [2019-02-15 10:58:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-15 10:58:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 157 transitions. [2019-02-15 10:58:15,445 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 157 transitions. Word has length 4 [2019-02-15 10:58:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:15,445 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 157 transitions. [2019-02-15 10:58:15,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:58:15,445 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 157 transitions. [2019-02-15 10:58:15,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:58:15,446 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:15,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:58:15,446 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:15,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:15,447 INFO L82 PathProgramCache]: Analyzing trace with hash 945004, now seen corresponding path program 1 times [2019-02-15 10:58:15,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:15,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:15,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:15,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:15,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:15,890 WARN L181 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-02-15 10:58:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:15,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:15,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:15,910 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:58:15,910 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [31] [2019-02-15 10:58:15,912 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:15,912 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:15,916 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:15,916 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:15,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:15,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:15,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:15,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:15,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:15,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:15,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:15,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:58:15,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:58:15,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:58:15,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:58:16,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,014 INFO L478 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 33 treesize of output 75 [2019-02-15 10:58:16,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,027 INFO L478 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 35 treesize of output 97 [2019-02-15 10:58:16,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:58:16,039 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,078 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,112 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,138 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,176 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:16,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:16,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:16,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:16,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:58:16,451 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,475 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,502 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,529 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,556 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,607 INFO L267 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-15 10:58:16,608 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 10:58:16,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:58:16,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:16,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:16,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-02-15 10:58:16,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,808 INFO L267 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-15 10:58:16,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-15 10:58:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:16,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:16,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:16,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:58:16,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:16,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:16,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:16,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:58:16,868 INFO L87 Difference]: Start difference. First operand 42 states and 157 transitions. Second operand 8 states. [2019-02-15 10:58:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:17,809 INFO L93 Difference]: Finished difference Result 98 states and 268 transitions. [2019-02-15 10:58:17,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:58:17,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:58:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:17,811 INFO L225 Difference]: With dead ends: 98 [2019-02-15 10:58:17,811 INFO L226 Difference]: Without dead ends: 97 [2019-02-15 10:58:17,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:58:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-15 10:58:17,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 47. [2019-02-15 10:58:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-15 10:58:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 197 transitions. [2019-02-15 10:58:17,825 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 197 transitions. Word has length 4 [2019-02-15 10:58:17,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:17,825 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 197 transitions. [2019-02-15 10:58:17,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:58:17,826 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 197 transitions. [2019-02-15 10:58:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:58:17,826 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:17,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:58:17,827 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:17,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:17,827 INFO L82 PathProgramCache]: Analyzing trace with hash 945500, now seen corresponding path program 1 times [2019-02-15 10:58:17,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:17,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:17,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:17,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:17,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:18,207 WARN L181 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-02-15 10:58:18,382 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-02-15 10:58:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:18,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:18,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:18,462 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:58:18,463 INFO L207 CegarAbsIntRunner]: [0], [22], [26], [31] [2019-02-15 10:58:18,464 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:18,464 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:18,467 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:18,470 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:18,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:18,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:18,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:18,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:18,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:18,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:18,639 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 10:58:18,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:58:18,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:58:18,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:58:18,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:58:18,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,724 INFO L478 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 33 treesize of output 75 [2019-02-15 10:58:18,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,734 INFO L478 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 35 treesize of output 97 [2019-02-15 10:58:18,886 INFO L303 Elim1Store]: Index analysis took 149 ms [2019-02-15 10:58:18,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:58:18,888 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,062 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,094 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,121 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,158 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:19,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:19,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:19,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:19,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:58:19,432 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,460 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,486 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,513 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,540 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,591 INFO L267 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-15 10:58:19,591 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 10:58:19,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:58:19,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:19,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:19,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-02-15 10:58:19,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,771 INFO L267 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-15 10:58:19,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-15 10:58:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:19,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:20,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:20,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:58:20,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:20,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:20,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:20,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:58:20,483 INFO L87 Difference]: Start difference. First operand 47 states and 197 transitions. Second operand 8 states. [2019-02-15 10:58:21,079 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-02-15 10:58:22,150 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-02-15 10:58:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:22,523 INFO L93 Difference]: Finished difference Result 91 states and 282 transitions. [2019-02-15 10:58:22,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:58:22,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:58:22,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:22,525 INFO L225 Difference]: With dead ends: 91 [2019-02-15 10:58:22,525 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 10:58:22,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:58:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 10:58:22,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2019-02-15 10:58:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-15 10:58:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 243 transitions. [2019-02-15 10:58:22,542 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 243 transitions. Word has length 4 [2019-02-15 10:58:22,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:22,542 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 243 transitions. [2019-02-15 10:58:22,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:58:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 243 transitions. [2019-02-15 10:58:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:58:22,543 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:22,543 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:58:22,543 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:22,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:22,544 INFO L82 PathProgramCache]: Analyzing trace with hash 933968, now seen corresponding path program 1 times [2019-02-15 10:58:22,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:22,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:22,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:22,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:22,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:22,698 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-02-15 10:58:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:22,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:22,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:22,713 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:58:22,713 INFO L207 CegarAbsIntRunner]: [0], [10], [26], [31] [2019-02-15 10:58:22,714 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:22,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:22,718 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:22,718 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:22,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:22,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:22,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:22,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:22,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:22,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:22,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:22,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:22,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:22,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:22,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:23,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:58:23,014 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,049 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,102 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,168 INFO L478 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 24 treesize of output 27 [2019-02-15 10:58:23,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:58:23,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:58:23,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:58:23,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:58:23,182 INFO L478 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 35 treesize of output 97 [2019-02-15 10:58:23,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:58:23,191 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,230 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,261 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,284 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,303 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,318 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,333 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,383 INFO L267 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-15 10:58:23,384 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 10:58:23,655 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-02-15 10:58:23,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:58:23,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:23,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:23,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:23,768 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:23,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-02-15 10:58:23,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:23,816 INFO L267 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-15 10:58:23,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-02-15 10:58:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:23,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:23,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:23,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:58:23,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:23,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:23,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:23,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:58:23,895 INFO L87 Difference]: Start difference. First operand 56 states and 243 transitions. Second operand 8 states. [2019-02-15 10:58:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:25,640 INFO L93 Difference]: Finished difference Result 92 states and 291 transitions. [2019-02-15 10:58:25,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:58:25,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:58:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:25,642 INFO L225 Difference]: With dead ends: 92 [2019-02-15 10:58:25,642 INFO L226 Difference]: Without dead ends: 90 [2019-02-15 10:58:25,643 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-15 10:58:25,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-15 10:58:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2019-02-15 10:58:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-15 10:58:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 254 transitions. [2019-02-15 10:58:25,659 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 254 transitions. Word has length 4 [2019-02-15 10:58:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:25,659 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 254 transitions. [2019-02-15 10:58:25,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:58:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 254 transitions. [2019-02-15 10:58:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:58:25,660 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:25,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:58:25,660 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:25,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:25,661 INFO L82 PathProgramCache]: Analyzing trace with hash 949406, now seen corresponding path program 1 times [2019-02-15 10:58:25,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:25,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:25,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:25,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:25,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:25,809 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-02-15 10:58:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:25,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:25,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:25,839 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:58:25,839 INFO L207 CegarAbsIntRunner]: [0], [26], [28], [31] [2019-02-15 10:58:25,848 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:25,848 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:25,852 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:25,852 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:25,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:25,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:25,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:25,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:25,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:25,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:25,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:25,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:58:25,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:58:25,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:58:25,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:58:25,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,960 INFO L478 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 33 treesize of output 75 [2019-02-15 10:58:25,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,970 INFO L478 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 35 treesize of output 97 [2019-02-15 10:58:25,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:58:25,984 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,025 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,058 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,085 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,143 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:26,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:26,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:26,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:26,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:58:26,469 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,494 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,521 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,549 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,577 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,628 INFO L267 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-15 10:58:26,628 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 10:58:26,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 106 [2019-02-15 10:58:26,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:58:26,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-15 10:58:26,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:150 [2019-02-15 10:58:26,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 142 [2019-02-15 10:58:27,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-02-15 10:58:27,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,936 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:27,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 97 [2019-02-15 10:58:27,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:28,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 36 dim-0 vars, and 7 xjuncts. [2019-02-15 10:58:28,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:172, output treesize:455 [2019-02-15 10:58:33,096 WARN L181 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 264 DAG size of output: 121 [2019-02-15 10:58:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:33,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:33,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:33,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:33,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:58:33,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:33,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:33,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:33,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=53, Unknown=1, NotChecked=0, Total=90 [2019-02-15 10:58:33,148 INFO L87 Difference]: Start difference. First operand 59 states and 254 transitions. Second operand 8 states. [2019-02-15 10:58:43,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:43,275 INFO L93 Difference]: Finished difference Result 101 states and 344 transitions. [2019-02-15 10:58:43,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:58:43,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:58:43,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:43,277 INFO L225 Difference]: With dead ends: 101 [2019-02-15 10:58:43,277 INFO L226 Difference]: Without dead ends: 100 [2019-02-15 10:58:43,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=44, Invalid=64, Unknown=2, NotChecked=0, Total=110 [2019-02-15 10:58:43,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-02-15 10:58:43,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 63. [2019-02-15 10:58:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-15 10:58:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 286 transitions. [2019-02-15 10:58:43,296 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 286 transitions. Word has length 4 [2019-02-15 10:58:43,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:43,296 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 286 transitions. [2019-02-15 10:58:43,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:58:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 286 transitions. [2019-02-15 10:58:43,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:58:43,297 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:43,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:58:43,297 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:43,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:43,298 INFO L82 PathProgramCache]: Analyzing trace with hash 951454, now seen corresponding path program 1 times [2019-02-15 10:58:43,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:43,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:43,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:43,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:43,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:43,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:43,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:43,362 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:58:43,363 INFO L207 CegarAbsIntRunner]: [0], [28], [32], [33] [2019-02-15 10:58:43,364 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:43,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:43,367 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:43,368 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:58:43,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:43,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:43,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:43,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:43,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:43,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:43,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:43,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 10:58:43,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 10:58:43,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 10:58:43,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 10:58:43,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 10:58:43,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:43,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 85 [2019-02-15 10:58:43,845 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:43,896 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:43,944 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:43,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:44,043 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:44,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:44,155 INFO L478 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 24 treesize of output 27 [2019-02-15 10:58:44,158 INFO L478 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 27 treesize of output 33 [2019-02-15 10:58:44,161 INFO L478 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 29 treesize of output 43 [2019-02-15 10:58:44,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:58:44,170 INFO L478 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 33 treesize of output 75 [2019-02-15 10:58:44,173 INFO L478 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 35 treesize of output 97 [2019-02-15 10:58:44,177 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 10:58:44,178 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:44,230 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:44,261 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:44,285 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:44,305 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:44,321 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:44,336 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:44,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:44,407 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:118, output treesize:120 [2019-02-15 10:58:44,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:44,442 INFO L478 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 126 [2019-02-15 10:58:44,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:44,512 INFO L267 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-15 10:58:44,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-02-15 10:58:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:44,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:44,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:44,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:58:44,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:44,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:58:44,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:58:44,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:58:44,593 INFO L87 Difference]: Start difference. First operand 63 states and 286 transitions. Second operand 6 states. [2019-02-15 10:58:44,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:44,836 INFO L93 Difference]: Finished difference Result 86 states and 322 transitions. [2019-02-15 10:58:44,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:58:44,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 10:58:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:44,838 INFO L225 Difference]: With dead ends: 86 [2019-02-15 10:58:44,838 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 10:58:44,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:58:44,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 10:58:44,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2019-02-15 10:58:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-15 10:58:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 294 transitions. [2019-02-15 10:58:44,851 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 294 transitions. Word has length 4 [2019-02-15 10:58:44,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:44,851 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 294 transitions. [2019-02-15 10:58:44,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:58:44,852 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 294 transitions. [2019-02-15 10:58:44,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:58:44,852 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:44,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:58:44,853 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:44,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:44,853 INFO L82 PathProgramCache]: Analyzing trace with hash 951266, now seen corresponding path program 2 times [2019-02-15 10:58:44,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:44,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:44,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:44,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:44,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:44,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:44,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:44,955 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:58:44,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:58:44,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:44,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:44,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:58:44,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:58:44,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 10:58:44,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:58:45,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:45,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:58:45,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:58:45,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:58:45,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:58:45,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,137 INFO L478 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 33 treesize of output 75 [2019-02-15 10:58:45,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,148 INFO L478 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 35 treesize of output 97 [2019-02-15 10:58:45,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,160 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 10:58:45,161 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:45,223 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:45,259 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:45,285 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:45,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:45,324 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:45,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:45,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 10:58:45,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 10:58:45,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 10:58:45,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 10:58:45,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 10:58:45,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:45,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 85 [2019-02-15 10:58:45,807 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:45,965 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:46,004 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:46,045 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:46,087 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:46,129 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:46,198 INFO L267 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-15 10:58:46,198 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-15 10:58:46,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:46,224 INFO L478 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 126 [2019-02-15 10:58:46,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:46,307 INFO L267 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-15 10:58:46,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-15 10:58:46,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:46,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:46,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:46,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:46,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:46,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:46,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:46,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:46,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:46,350 INFO L478 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 140 [2019-02-15 10:58:46,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:46,421 INFO L267 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-15 10:58:46,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:76 [2019-02-15 10:58:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:46,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:46,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:46,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:58:46,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:46,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:46,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:46,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:58:46,480 INFO L87 Difference]: Start difference. First operand 64 states and 294 transitions. Second operand 8 states. [2019-02-15 10:58:47,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:47,129 INFO L93 Difference]: Finished difference Result 119 states and 384 transitions. [2019-02-15 10:58:47,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:58:47,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:58:47,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:47,131 INFO L225 Difference]: With dead ends: 119 [2019-02-15 10:58:47,132 INFO L226 Difference]: Without dead ends: 115 [2019-02-15 10:58:47,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:58:47,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-15 10:58:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 67. [2019-02-15 10:58:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-15 10:58:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 286 transitions. [2019-02-15 10:58:47,153 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 286 transitions. Word has length 4 [2019-02-15 10:58:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:47,153 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 286 transitions. [2019-02-15 10:58:47,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:58:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 286 transitions. [2019-02-15 10:58:47,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:58:47,154 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:47,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:58:47,154 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:47,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:47,155 INFO L82 PathProgramCache]: Analyzing trace with hash 938000, now seen corresponding path program 1 times [2019-02-15 10:58:47,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:47,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:47,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:58:47,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:47,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:47,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:47,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:47,233 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:58:47,233 INFO L207 CegarAbsIntRunner]: [0], [14], [32], [33] [2019-02-15 10:58:47,235 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:47,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:47,238 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:47,238 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:58:47,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:47,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:47,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:47,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:47,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:47,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:47,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:47,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:58:47,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:58:47,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:58:47,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:58:47,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,335 INFO L478 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 33 treesize of output 75 [2019-02-15 10:58:47,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,345 INFO L478 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 35 treesize of output 97 [2019-02-15 10:58:47,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:58:47,358 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,397 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,431 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,458 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,497 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:47,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:47,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:47,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:47,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:58:47,772 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,800 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,826 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,854 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,881 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:47,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:47,933 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 10:58:47,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:47,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:58:47,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:48,029 INFO L267 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-15 10:58:48,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:48,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:48,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:48,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:58:48,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:48,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:58:48,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:58:48,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:58:48,085 INFO L87 Difference]: Start difference. First operand 67 states and 286 transitions. Second operand 6 states. [2019-02-15 10:58:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:48,965 INFO L93 Difference]: Finished difference Result 90 states and 322 transitions. [2019-02-15 10:58:48,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:58:48,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 10:58:48,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:48,968 INFO L225 Difference]: With dead ends: 90 [2019-02-15 10:58:48,969 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 10:58:48,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:58:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 10:58:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2019-02-15 10:58:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-15 10:58:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 294 transitions. [2019-02-15 10:58:48,987 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 294 transitions. Word has length 4 [2019-02-15 10:58:48,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:48,987 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 294 transitions. [2019-02-15 10:58:48,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:58:48,988 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 294 transitions. [2019-02-15 10:58:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:48,988 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:48,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:48,989 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:48,989 INFO L82 PathProgramCache]: Analyzing trace with hash 29197230, now seen corresponding path program 1 times [2019-02-15 10:58:48,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:48,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:48,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:48,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:48,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:49,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:49,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:49,125 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:49,126 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [34], [35] [2019-02-15 10:58:49,126 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:49,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:49,130 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:49,131 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:58:49,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:49,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:49,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:49,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:49,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:49,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:49,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:49,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 63 [2019-02-15 10:58:49,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2019-02-15 10:58:49,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2019-02-15 10:58:49,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 72 [2019-02-15 10:58:49,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2019-02-15 10:58:49,324 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:49,347 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:49,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:49,396 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:49,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:49,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:58:49,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 33 [2019-02-15 10:58:49,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-15 10:58:49,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2019-02-15 10:58:49,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:58:49,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-02-15 10:58:49,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 88 [2019-02-15 10:58:49,494 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:49,529 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:49,556 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:49,576 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:49,591 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:49,607 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:49,622 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:49,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:49,666 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:84, output treesize:88 [2019-02-15 10:58:49,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:49,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 83 [2019-02-15 10:58:49,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:49,746 INFO L267 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-15 10:58:49,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:93, output treesize:63 [2019-02-15 10:58:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:49,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:49,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:49,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 6 [2019-02-15 10:58:49,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:49,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:58:49,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:58:49,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:58:49,798 INFO L87 Difference]: Start difference. First operand 68 states and 294 transitions. Second operand 7 states. [2019-02-15 10:58:50,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:50,109 INFO L93 Difference]: Finished difference Result 77 states and 308 transitions. [2019-02-15 10:58:50,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:58:50,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-15 10:58:50,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:50,111 INFO L225 Difference]: With dead ends: 77 [2019-02-15 10:58:50,111 INFO L226 Difference]: Without dead ends: 76 [2019-02-15 10:58:50,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:58:50,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-15 10:58:50,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2019-02-15 10:58:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-15 10:58:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 301 transitions. [2019-02-15 10:58:50,127 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 301 transitions. Word has length 5 [2019-02-15 10:58:50,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:50,128 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 301 transitions. [2019-02-15 10:58:50,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:58:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 301 transitions. [2019-02-15 10:58:50,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:50,128 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:50,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:50,128 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:50,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:50,129 INFO L82 PathProgramCache]: Analyzing trace with hash 29172180, now seen corresponding path program 1 times [2019-02-15 10:58:50,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:50,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:50,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:50,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:50,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:50,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:58:50,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:50,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:50,319 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:50,320 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [32], [33] [2019-02-15 10:58:50,320 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:50,321 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:50,323 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:50,324 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:50,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:50,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:50,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:50,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:50,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:50,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:50,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:50,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:58:50,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:58:50,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:58:50,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:58:50,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,408 INFO L478 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 33 treesize of output 75 [2019-02-15 10:58:50,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,418 INFO L478 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 35 treesize of output 97 [2019-02-15 10:58:50,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:58:50,430 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:50,472 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:50,505 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:50,532 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:50,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:50,573 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:50,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:50,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:50,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:50,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:50,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:50,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:50,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:58:50,851 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:50,879 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:50,905 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:50,933 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:50,961 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:51,012 INFO L267 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-15 10:58:51,012 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 10:58:51,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:51,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:58:51,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:51,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:51,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:51,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:51,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:51,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:51,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:51,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:51,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:51,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:51,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:51,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 10:58:51,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:51,231 INFO L267 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-15 10:58:51,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-15 10:58:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:51,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:51,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:51,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:51,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:58:51,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:51,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:51,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:51,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:58:51,295 INFO L87 Difference]: Start difference. First operand 69 states and 301 transitions. Second operand 8 states. [2019-02-15 10:58:51,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:51,773 INFO L93 Difference]: Finished difference Result 102 states and 353 transitions. [2019-02-15 10:58:51,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:58:51,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:58:51,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:51,775 INFO L225 Difference]: With dead ends: 102 [2019-02-15 10:58:51,776 INFO L226 Difference]: Without dead ends: 101 [2019-02-15 10:58:51,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:58:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-15 10:58:51,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 71. [2019-02-15 10:58:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-15 10:58:51,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 317 transitions. [2019-02-15 10:58:51,800 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 317 transitions. Word has length 5 [2019-02-15 10:58:51,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:51,800 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 317 transitions. [2019-02-15 10:58:51,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:58:51,800 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 317 transitions. [2019-02-15 10:58:51,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:51,801 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:51,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:51,801 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:51,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:51,802 INFO L82 PathProgramCache]: Analyzing trace with hash 29171496, now seen corresponding path program 1 times [2019-02-15 10:58:51,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:51,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:51,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:51,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:51,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:52,024 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 10:58:52,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:52,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:52,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:52,062 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:52,062 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [31] [2019-02-15 10:58:52,063 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:52,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:52,066 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:52,066 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:58:52,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:52,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:52,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:52,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:52,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:52,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:52,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:52,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:52,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:52,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:52,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:52,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:58:52,334 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:52,361 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:52,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:52,414 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:52,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:52,476 INFO L478 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 24 treesize of output 27 [2019-02-15 10:58:52,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:58:52,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:58:52,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:58:52,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:58:52,494 INFO L478 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 35 treesize of output 97 [2019-02-15 10:58:52,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:58:52,534 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:52,573 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:52,604 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:52,628 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:52,647 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:52,663 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:52,678 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:52,728 INFO L267 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-15 10:58:52,729 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 10:58:52,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:58:52,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:52,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:52,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:52,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 10:58:52,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:52,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:52,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 10:58:52,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,945 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:52,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:52,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-02-15 10:58:52,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:53,000 INFO L267 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-15 10:58:53,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 10:58:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:53,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:53,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:53,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:58:53,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:53,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:58:53,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:58:53,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:58:53,070 INFO L87 Difference]: Start difference. First operand 71 states and 317 transitions. Second operand 10 states. [2019-02-15 10:58:55,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:55,252 INFO L93 Difference]: Finished difference Result 147 states and 540 transitions. [2019-02-15 10:58:55,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:58:55,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:58:55,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:55,254 INFO L225 Difference]: With dead ends: 147 [2019-02-15 10:58:55,255 INFO L226 Difference]: Without dead ends: 146 [2019-02-15 10:58:55,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:58:55,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-02-15 10:58:55,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 89. [2019-02-15 10:58:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-15 10:58:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 464 transitions. [2019-02-15 10:58:55,286 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 464 transitions. Word has length 5 [2019-02-15 10:58:55,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:55,286 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 464 transitions. [2019-02-15 10:58:55,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:58:55,287 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 464 transitions. [2019-02-15 10:58:55,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:55,287 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:55,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:55,288 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:55,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:55,288 INFO L82 PathProgramCache]: Analyzing trace with hash 29187556, now seen corresponding path program 1 times [2019-02-15 10:58:55,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:55,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:55,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:55,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:55,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:55,424 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 10:58:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:55,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:55,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:55,460 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:55,460 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [32], [33] [2019-02-15 10:58:55,461 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:55,461 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:55,465 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:55,465 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:55,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:55,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:55,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:55,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:55,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:55,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:55,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:55,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:58:55,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:58:55,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:58:55,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:58:55,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,539 INFO L478 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 33 treesize of output 75 [2019-02-15 10:58:55,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,548 INFO L478 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 35 treesize of output 97 [2019-02-15 10:58:55,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:58:55,559 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:55,599 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:55,633 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:55,660 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:55,680 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:55,696 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:55,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:55,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:55,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:55,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:55,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:55,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:58:55,965 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:55,992 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,019 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,046 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,073 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,124 INFO L267 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-15 10:58:56,124 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 10:58:56,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:58:56,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:56,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:56,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,357 INFO L303 Elim1Store]: Index analysis took 126 ms [2019-02-15 10:58:56,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-02-15 10:58:56,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,405 INFO L267 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-15 10:58:56,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-15 10:58:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:56,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:56,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:56,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:58:56,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:56,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:56,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:56,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:58:56,470 INFO L87 Difference]: Start difference. First operand 89 states and 464 transitions. Second operand 8 states. [2019-02-15 10:58:56,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:56,893 INFO L93 Difference]: Finished difference Result 128 states and 531 transitions. [2019-02-15 10:58:56,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:58:56,894 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:58:56,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:56,896 INFO L225 Difference]: With dead ends: 128 [2019-02-15 10:58:56,896 INFO L226 Difference]: Without dead ends: 127 [2019-02-15 10:58:56,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:58:56,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-15 10:58:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2019-02-15 10:58:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-15 10:58:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 488 transitions. [2019-02-15 10:58:56,928 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 488 transitions. Word has length 5 [2019-02-15 10:58:56,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:56,928 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 488 transitions. [2019-02-15 10:58:56,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:58:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 488 transitions. [2019-02-15 10:58:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:56,929 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:56,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:56,929 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:56,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:56,929 INFO L82 PathProgramCache]: Analyzing trace with hash 29187368, now seen corresponding path program 1 times [2019-02-15 10:58:56,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:56,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:56,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:56,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:56,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:57,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:57,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:57,040 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:57,041 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [26], [31] [2019-02-15 10:58:57,043 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:57,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:57,047 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:57,047 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:58:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:57,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:57,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:57,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:57,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:57,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:57,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:57,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:58:57,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:58:57,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:58:57,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:58:57,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,126 INFO L478 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 33 treesize of output 75 [2019-02-15 10:58:57,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,139 INFO L478 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 35 treesize of output 97 [2019-02-15 10:58:57,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:58:57,153 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,199 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,232 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,257 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,277 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,292 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:57,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:57,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:57,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:57,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:58:57,568 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,593 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,620 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,647 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,674 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:57,725 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 10:58:57,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:58:57,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:57,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:57,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-02-15 10:58:57,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:57,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 10:58:57,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,008 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:58,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-02-15 10:58:58,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:58,061 INFO L267 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-15 10:58:58,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 10:58:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:58,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:58,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:58,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:58:58,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:58,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:58:58,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:58:58,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:58:58,159 INFO L87 Difference]: Start difference. First operand 92 states and 488 transitions. Second operand 10 states. [2019-02-15 10:59:00,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:00,914 INFO L93 Difference]: Finished difference Result 146 states and 591 transitions. [2019-02-15 10:59:00,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:00,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:59:00,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:00,917 INFO L225 Difference]: With dead ends: 146 [2019-02-15 10:59:00,917 INFO L226 Difference]: Without dead ends: 144 [2019-02-15 10:59:00,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:59:00,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-02-15 10:59:00,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 98. [2019-02-15 10:59:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-15 10:59:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 536 transitions. [2019-02-15 10:59:00,961 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 536 transitions. Word has length 5 [2019-02-15 10:59:00,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:00,961 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 536 transitions. [2019-02-15 10:59:00,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 536 transitions. [2019-02-15 10:59:00,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:00,962 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:00,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:00,963 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:00,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:00,963 INFO L82 PathProgramCache]: Analyzing trace with hash 29175836, now seen corresponding path program 1 times [2019-02-15 10:59:00,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:00,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:00,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:00,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:00,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:01,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:01,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:01,097 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:01,098 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [26], [31] [2019-02-15 10:59:01,099 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:01,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:01,101 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:01,101 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:01,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:01,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:01,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:01,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:01,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:01,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:01,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:01,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:59:01,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:59:01,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:01,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:01,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,206 INFO L478 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 33 treesize of output 75 [2019-02-15 10:59:01,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,217 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:01,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:59:01,229 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:01,272 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:01,304 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:01,331 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:01,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:01,368 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:01,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:01,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:01,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:01,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:01,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:01,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:59:01,644 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:01,671 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:01,698 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:01,725 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:01,753 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:01,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:01,810 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 10:59:01,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:59:01,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:01,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:01,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:01,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,979 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:01,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-02-15 10:59:01,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:02,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-02-15 10:59:02,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,069 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:02,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 108 [2019-02-15 10:59:02,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,116 INFO L267 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-15 10:59:02,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:57 [2019-02-15 10:59:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:02,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:02,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:02,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:59:02,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:02,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:59:02,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:59:02,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:59:02,217 INFO L87 Difference]: Start difference. First operand 98 states and 536 transitions. Second operand 10 states. [2019-02-15 10:59:05,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:05,229 INFO L93 Difference]: Finished difference Result 140 states and 582 transitions. [2019-02-15 10:59:05,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:05,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:59:05,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:05,232 INFO L225 Difference]: With dead ends: 140 [2019-02-15 10:59:05,232 INFO L226 Difference]: Without dead ends: 138 [2019-02-15 10:59:05,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:59:05,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-15 10:59:05,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 92. [2019-02-15 10:59:05,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-15 10:59:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 486 transitions. [2019-02-15 10:59:05,267 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 486 transitions. Word has length 5 [2019-02-15 10:59:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:05,267 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 486 transitions. [2019-02-15 10:59:05,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 486 transitions. [2019-02-15 10:59:05,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:05,268 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:05,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:05,268 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:05,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:05,268 INFO L82 PathProgramCache]: Analyzing trace with hash 29191274, now seen corresponding path program 1 times [2019-02-15 10:59:05,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:05,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:05,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:05,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:05,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:05,418 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-02-15 10:59:05,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:05,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:05,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:05,461 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:05,462 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [28], [31] [2019-02-15 10:59:05,463 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:05,463 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:05,465 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:05,465 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:05,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:05,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:05,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:05,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:05,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:05,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:05,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:05,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:05,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:05,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:05,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:05,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:59:05,722 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:05,748 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:05,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:05,804 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:05,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:05,871 INFO L478 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 24 treesize of output 27 [2019-02-15 10:59:05,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:59:05,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:05,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:05,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:59:05,888 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:05,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:59:05,896 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:05,945 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:05,976 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:06,000 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:06,019 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:06,034 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:06,047 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:06,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:06,096 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 10:59:06,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-15 10:59:06,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:59:06,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 10:59:06,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:150 [2019-02-15 10:59:06,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,366 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:06,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 112 [2019-02-15 10:59:06,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:06,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,493 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:06,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 131 [2019-02-15 10:59:06,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-15 10:59:06,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-02-15 10:59:06,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:185 [2019-02-15 10:59:06,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,904 INFO L478 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 8 case distinctions, treesize of input 78 treesize of output 136 [2019-02-15 10:59:06,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 10:59:07,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,400 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:07,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 105 [2019-02-15 10:59:07,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:07,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-02-15 10:59:07,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:346 [2019-02-15 10:59:12,175 WARN L181 SmtUtils]: Spent 4.48 s on a formula simplification. DAG size of input: 211 DAG size of output: 109 [2019-02-15 10:59:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:12,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:12,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:12,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:59:12,245 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:12,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:59:12,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:59:12,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:59:12,246 INFO L87 Difference]: Start difference. First operand 92 states and 486 transitions. Second operand 10 states. [2019-02-15 10:59:16,720 WARN L181 SmtUtils]: Spent 4.26 s on a formula simplification. DAG size of input: 122 DAG size of output: 89 [2019-02-15 10:59:18,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:18,486 INFO L93 Difference]: Finished difference Result 155 states and 683 transitions. [2019-02-15 10:59:18,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:59:18,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:59:18,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:18,489 INFO L225 Difference]: With dead ends: 155 [2019-02-15 10:59:18,489 INFO L226 Difference]: Without dead ends: 154 [2019-02-15 10:59:18,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:59:18,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-02-15 10:59:18,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 98. [2019-02-15 10:59:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-15 10:59:18,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 534 transitions. [2019-02-15 10:59:18,535 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 534 transitions. Word has length 5 [2019-02-15 10:59:18,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:18,536 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 534 transitions. [2019-02-15 10:59:18,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:18,536 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 534 transitions. [2019-02-15 10:59:18,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:18,537 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:18,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:18,537 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:18,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:18,537 INFO L82 PathProgramCache]: Analyzing trace with hash 29193322, now seen corresponding path program 1 times [2019-02-15 10:59:18,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:18,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:18,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:18,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:18,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:18,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:18,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:18,650 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:18,651 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [32], [33] [2019-02-15 10:59:18,652 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:18,652 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:18,655 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:18,655 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:18,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:18,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:18,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:18,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:18,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:18,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:18,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:18,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 10:59:18,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 10:59:18,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 10:59:18,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 10:59:18,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 10:59:19,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,315 INFO L303 Elim1Store]: Index analysis took 266 ms [2019-02-15 10:59:19,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 85 [2019-02-15 10:59:19,316 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,392 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,434 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,517 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,614 INFO L478 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 24 treesize of output 27 [2019-02-15 10:59:19,617 INFO L478 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 27 treesize of output 33 [2019-02-15 10:59:19,619 INFO L478 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 29 treesize of output 43 [2019-02-15 10:59:19,622 INFO L478 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 31 treesize of output 57 [2019-02-15 10:59:19,625 INFO L478 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 33 treesize of output 75 [2019-02-15 10:59:19,628 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:19,631 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 10:59:19,632 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,685 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,716 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,740 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,759 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,774 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,789 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,859 INFO L267 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-15 10:59:19,859 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-15 10:59:19,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,887 INFO L478 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-15 10:59:19,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,955 INFO L267 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-15 10:59:19,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-15 10:59:19,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,990 INFO L478 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 142 [2019-02-15 10:59:19,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,061 INFO L267 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-15 10:59:20,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-02-15 10:59:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:20,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:20,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:20,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:59:20,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:20,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:59:20,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:59:20,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:59:20,135 INFO L87 Difference]: Start difference. First operand 98 states and 534 transitions. Second operand 8 states. [2019-02-15 10:59:20,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:20,755 INFO L93 Difference]: Finished difference Result 137 states and 601 transitions. [2019-02-15 10:59:20,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:59:20,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:59:20,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:20,757 INFO L225 Difference]: With dead ends: 137 [2019-02-15 10:59:20,757 INFO L226 Difference]: Without dead ends: 132 [2019-02-15 10:59:20,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:59:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-02-15 10:59:20,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2019-02-15 10:59:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-15 10:59:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 556 transitions. [2019-02-15 10:59:20,800 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 556 transitions. Word has length 5 [2019-02-15 10:59:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:20,800 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 556 transitions. [2019-02-15 10:59:20,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:59:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 556 transitions. [2019-02-15 10:59:20,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:20,801 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:20,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:20,801 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:20,801 INFO L82 PathProgramCache]: Analyzing trace with hash 29193134, now seen corresponding path program 2 times [2019-02-15 10:59:20,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:20,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:20,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:20,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:20,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:20,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:20,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:20,870 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:59:20,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:59:20,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:20,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:20,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:59:20,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:59:20,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:59:20,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:59:20,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:20,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 10:59:20,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 10:59:21,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 10:59:21,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 10:59:21,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 10:59:21,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 85 [2019-02-15 10:59:21,282 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,321 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,364 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,448 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:59:21,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:59:21,551 INFO L478 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 29 treesize of output 43 [2019-02-15 10:59:21,554 INFO L478 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 31 treesize of output 57 [2019-02-15 10:59:21,593 INFO L478 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 33 treesize of output 75 [2019-02-15 10:59:21,596 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:21,604 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 10:59:21,604 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,659 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,690 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,714 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,733 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,750 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,765 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:21,833 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-15 10:59:21,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,872 INFO L478 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-15 10:59:21,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:21,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-15 10:59:21,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,984 INFO L478 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 142 [2019-02-15 10:59:21,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:22,056 INFO L267 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-15 10:59:22,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-15 10:59:22,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,101 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:22,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,103 INFO L478 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 151 [2019-02-15 10:59:22,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:22,176 INFO L267 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-15 10:59:22,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-02-15 10:59:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:22,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:22,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:22,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:59:22,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:22,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:59:22,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:59:22,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:59:22,265 INFO L87 Difference]: Start difference. First operand 100 states and 556 transitions. Second operand 10 states. [2019-02-15 10:59:23,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:23,096 INFO L93 Difference]: Finished difference Result 154 states and 681 transitions. [2019-02-15 10:59:23,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:23,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:59:23,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:23,098 INFO L225 Difference]: With dead ends: 154 [2019-02-15 10:59:23,098 INFO L226 Difference]: Without dead ends: 152 [2019-02-15 10:59:23,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:59:23,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-15 10:59:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 109. [2019-02-15 10:59:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-15 10:59:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 628 transitions. [2019-02-15 10:59:23,158 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 628 transitions. Word has length 5 [2019-02-15 10:59:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:23,158 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 628 transitions. [2019-02-15 10:59:23,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 628 transitions. [2019-02-15 10:59:23,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:23,159 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:23,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:23,159 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:23,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:23,160 INFO L82 PathProgramCache]: Analyzing trace with hash 29179868, now seen corresponding path program 1 times [2019-02-15 10:59:23,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:23,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:23,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:59:23,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:23,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:23,399 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-02-15 10:59:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:23,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:23,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:23,412 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:23,412 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [32], [33] [2019-02-15 10:59:23,413 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:23,413 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:23,414 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:23,415 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:23,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:23,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:23,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:23,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:23,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:23,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:23,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:23,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:23,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:23,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:23,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:23,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:23,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:59:23,686 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:23,715 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:23,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:23,767 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:23,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:23,832 INFO L478 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 24 treesize of output 27 [2019-02-15 10:59:23,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:59:23,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:23,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:23,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:59:23,844 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:23,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:59:23,853 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:23,892 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:23,922 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:23,946 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:23,965 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:23,981 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:23,995 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:24,045 INFO L267 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-15 10:59:24,045 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 10:59:24,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:59:24,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:24,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:24,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:24,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 10:59:24,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:24,217 INFO L267 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-15 10:59:24,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-15 10:59:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:24,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:24,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:24,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:59:24,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:24,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:59:24,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:59:24,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:59:24,283 INFO L87 Difference]: Start difference. First operand 109 states and 628 transitions. Second operand 8 states. [2019-02-15 10:59:24,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:24,750 INFO L93 Difference]: Finished difference Result 140 states and 686 transitions. [2019-02-15 10:59:24,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:59:24,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:59:24,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:24,753 INFO L225 Difference]: With dead ends: 140 [2019-02-15 10:59:24,754 INFO L226 Difference]: Without dead ends: 139 [2019-02-15 10:59:24,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:59:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-15 10:59:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 112. [2019-02-15 10:59:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-15 10:59:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 652 transitions. [2019-02-15 10:59:24,799 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 652 transitions. Word has length 5 [2019-02-15 10:59:24,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:24,799 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 652 transitions. [2019-02-15 10:59:24,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:59:24,800 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 652 transitions. [2019-02-15 10:59:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:24,800 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:24,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:24,800 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:24,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:24,801 INFO L82 PathProgramCache]: Analyzing trace with hash 29179680, now seen corresponding path program 1 times [2019-02-15 10:59:24,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:24,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:24,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:24,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:24,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:24,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:24,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:24,959 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:24,959 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [26], [31] [2019-02-15 10:59:24,960 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:24,960 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:24,962 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:24,963 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:24,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:24,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:24,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:24,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:24,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:24,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:24,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:25,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:59:25,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:59:25,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:25,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:25,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,031 INFO L478 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 33 treesize of output 75 [2019-02-15 10:59:25,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,152 INFO L303 Elim1Store]: Index analysis took 112 ms [2019-02-15 10:59:25,152 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:25,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:59:25,164 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:25,207 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:25,240 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:25,266 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:25,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:25,304 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:25,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:25,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:25,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:25,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:25,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:25,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:59:25,573 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:25,600 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:25,627 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:25,654 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:25,681 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:25,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:25,732 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 10:59:25,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:59:25,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:25,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:25,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:25,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 10:59:25,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:25,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:25,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 10:59:25,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,998 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:25,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-02-15 10:59:26,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:26,051 INFO L267 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-15 10:59:26,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 10:59:26,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:26,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:26,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:26,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:59:26,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:26,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:59:26,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:59:26,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:59:26,135 INFO L87 Difference]: Start difference. First operand 112 states and 652 transitions. Second operand 10 states. [2019-02-15 10:59:26,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:26,861 INFO L93 Difference]: Finished difference Result 161 states and 770 transitions. [2019-02-15 10:59:26,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:26,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:59:26,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:26,864 INFO L225 Difference]: With dead ends: 161 [2019-02-15 10:59:26,864 INFO L226 Difference]: Without dead ends: 159 [2019-02-15 10:59:26,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:59:26,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-15 10:59:26,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 121. [2019-02-15 10:59:26,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-15 10:59:26,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 724 transitions. [2019-02-15 10:59:26,917 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 724 transitions. Word has length 5 [2019-02-15 10:59:26,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:26,918 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 724 transitions. [2019-02-15 10:59:26,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:26,918 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 724 transitions. [2019-02-15 10:59:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:26,918 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:26,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:26,918 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:26,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:26,919 INFO L82 PathProgramCache]: Analyzing trace with hash 28830064, now seen corresponding path program 1 times [2019-02-15 10:59:26,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:26,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:26,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:26,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:26,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:59:26,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:26,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:26,968 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:26,968 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [32], [33] [2019-02-15 10:59:26,972 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:26,972 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:26,976 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:26,976 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:26,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:26,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:26,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:26,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:26,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:26,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:26,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:27,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:27,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:27,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:27,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:27,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:59:27,266 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:27,301 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:27,339 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:27,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:27,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:27,459 INFO L478 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 24 treesize of output 27 [2019-02-15 10:59:27,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:59:27,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:27,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:27,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:59:27,477 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:27,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:59:27,489 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:27,531 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:27,561 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:27,585 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:27,604 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:27,619 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:27,634 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:27,684 INFO L267 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-15 10:59:27,685 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 10:59:27,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:59:27,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:27,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:27,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:27,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,875 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:27,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-02-15 10:59:27,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:27,923 INFO L267 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-15 10:59:27,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-02-15 10:59:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:27,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:28,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:28,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:59:28,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:28,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:59:28,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:59:28,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:59:28,038 INFO L87 Difference]: Start difference. First operand 121 states and 724 transitions. Second operand 8 states. [2019-02-15 10:59:28,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:28,465 INFO L93 Difference]: Finished difference Result 156 states and 773 transitions. [2019-02-15 10:59:28,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:59:28,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:59:28,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:28,467 INFO L225 Difference]: With dead ends: 156 [2019-02-15 10:59:28,467 INFO L226 Difference]: Without dead ends: 154 [2019-02-15 10:59:28,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:59:28,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-02-15 10:59:28,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 123. [2019-02-15 10:59:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-15 10:59:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 733 transitions. [2019-02-15 10:59:28,526 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 733 transitions. Word has length 5 [2019-02-15 10:59:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:28,526 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 733 transitions. [2019-02-15 10:59:28,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:59:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 733 transitions. [2019-02-15 10:59:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:28,527 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:28,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:28,527 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:28,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:28,528 INFO L82 PathProgramCache]: Analyzing trace with hash 28818532, now seen corresponding path program 1 times [2019-02-15 10:59:28,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:28,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:28,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:28,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:28,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:28,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:28,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:28,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:28,794 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:28,794 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [32], [33] [2019-02-15 10:59:28,796 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:28,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:28,798 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:28,799 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:28,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:28,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:28,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:28,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:28,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:28,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:28,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:29,039 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 10:59:29,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:29,505 WARN L181 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-02-15 10:59:29,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:29,743 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-02-15 10:59:29,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:29,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:29,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:29,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:59:29,893 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:29,922 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:29,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:29,978 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,041 INFO L478 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 24 treesize of output 27 [2019-02-15 10:59:30,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:59:30,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:30,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:30,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:59:30,056 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:30,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:59:30,067 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,105 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,135 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,158 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,177 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,193 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,208 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:30,257 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 10:59:30,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:59:30,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,355 INFO L267 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-15 10:59:30,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:30,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,576 INFO L303 Elim1Store]: Index analysis took 204 ms [2019-02-15 10:59:30,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-02-15 10:59:30,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,761 INFO L267 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-15 10:59:30,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-15 10:59:30,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:30,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:30,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:30,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:59:30,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:30,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:59:30,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:59:30,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:59:30,810 INFO L87 Difference]: Start difference. First operand 123 states and 733 transitions. Second operand 8 states. [2019-02-15 10:59:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:31,155 INFO L93 Difference]: Finished difference Result 168 states and 891 transitions. [2019-02-15 10:59:31,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:31,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:59:31,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:31,158 INFO L225 Difference]: With dead ends: 168 [2019-02-15 10:59:31,159 INFO L226 Difference]: Without dead ends: 167 [2019-02-15 10:59:31,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:59:31,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-15 10:59:31,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 139. [2019-02-15 10:59:31,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-15 10:59:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 865 transitions. [2019-02-15 10:59:31,221 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 865 transitions. Word has length 5 [2019-02-15 10:59:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:31,221 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 865 transitions. [2019-02-15 10:59:31,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:59:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 865 transitions. [2019-02-15 10:59:31,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:31,221 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:31,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:31,222 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:31,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:31,222 INFO L82 PathProgramCache]: Analyzing trace with hash 28818344, now seen corresponding path program 1 times [2019-02-15 10:59:31,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:31,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:31,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:31,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:31,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:31,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:31,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:31,321 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:31,321 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [26], [31] [2019-02-15 10:59:31,325 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:31,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:31,328 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:31,328 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:31,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:31,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:31,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:31,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:31,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:31,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:31,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:31,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:59:31,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:59:31,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:31,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:31,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,402 INFO L478 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 33 treesize of output 75 [2019-02-15 10:59:31,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,412 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:31,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:59:31,425 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:31,466 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:31,498 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:31,524 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:31,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:31,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:31,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:31,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:31,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:31,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:31,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:31,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:59:31,838 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:31,865 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:31,894 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:31,921 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:31,948 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:31,998 INFO L267 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-15 10:59:31,998 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 10:59:32,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:59:32,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:32,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:32,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:32,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-02-15 10:59:32,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:32,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:32,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-15 10:59:32,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,220 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:32,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 134 [2019-02-15 10:59:32,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:32,275 INFO L267 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-15 10:59:32,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-15 10:59:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:32,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:32,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:32,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:59:32,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:32,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:59:32,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:59:32,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:59:32,350 INFO L87 Difference]: Start difference. First operand 139 states and 865 transitions. Second operand 10 states. [2019-02-15 10:59:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:33,072 INFO L93 Difference]: Finished difference Result 242 states and 1262 transitions. [2019-02-15 10:59:33,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:59:33,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:59:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:33,076 INFO L225 Difference]: With dead ends: 242 [2019-02-15 10:59:33,076 INFO L226 Difference]: Without dead ends: 240 [2019-02-15 10:59:33,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:59:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-02-15 10:59:33,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 178. [2019-02-15 10:59:33,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-15 10:59:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 1177 transitions. [2019-02-15 10:59:33,152 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 1177 transitions. Word has length 5 [2019-02-15 10:59:33,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:33,152 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 1177 transitions. [2019-02-15 10:59:33,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 1177 transitions. [2019-02-15 10:59:33,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:33,153 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:33,153 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:33,153 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:33,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:33,153 INFO L82 PathProgramCache]: Analyzing trace with hash 28835830, now seen corresponding path program 1 times [2019-02-15 10:59:33,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:33,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:33,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:33,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:33,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:33,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:59:33,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:33,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:33,306 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:33,306 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [32], [33] [2019-02-15 10:59:33,307 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:33,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:33,309 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:33,309 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:33,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:33,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:33,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:33,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:33,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:33,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:33,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:33,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:59:33,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:59:33,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:33,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:33,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,382 INFO L478 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 33 treesize of output 75 [2019-02-15 10:59:33,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,393 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:33,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,405 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 10:59:33,405 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:33,463 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:33,494 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:33,518 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:33,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:33,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:33,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:33,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 10:59:33,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 10:59:33,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 10:59:33,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 10:59:33,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 10:59:33,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 85 [2019-02-15 10:59:33,965 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,006 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,047 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,089 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,131 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,173 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,241 INFO L267 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-15 10:59:34,241 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-15 10:59:34,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,271 INFO L478 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 126 [2019-02-15 10:59:34,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,339 INFO L267 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-15 10:59:34,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-15 10:59:34,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:34,378 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:34,380 INFO L478 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 134 [2019-02-15 10:59:34,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:34,450 INFO L267 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-15 10:59:34,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:80 [2019-02-15 10:59:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:34,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:34,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:34,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:59:34,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:34,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:59:34,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:59:34,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:59:34,518 INFO L87 Difference]: Start difference. First operand 178 states and 1177 transitions. Second operand 8 states. [2019-02-15 10:59:35,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:35,154 INFO L93 Difference]: Finished difference Result 211 states and 1231 transitions. [2019-02-15 10:59:35,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:59:35,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:59:35,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:35,157 INFO L225 Difference]: With dead ends: 211 [2019-02-15 10:59:35,157 INFO L226 Difference]: Without dead ends: 203 [2019-02-15 10:59:35,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:59:35,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-15 10:59:35,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2019-02-15 10:59:35,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-02-15 10:59:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 1188 transitions. [2019-02-15 10:59:35,245 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 1188 transitions. Word has length 5 [2019-02-15 10:59:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:35,245 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 1188 transitions. [2019-02-15 10:59:35,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:59:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 1188 transitions. [2019-02-15 10:59:35,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:35,247 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:35,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:35,247 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:35,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:35,247 INFO L82 PathProgramCache]: Analyzing trace with hash 28822376, now seen corresponding path program 1 times [2019-02-15 10:59:35,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:35,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:35,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:35,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:35,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:59:35,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:35,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:35,322 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:35,323 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [32], [33] [2019-02-15 10:59:35,324 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:35,324 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:35,326 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:35,326 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:35,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:35,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:35,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:35,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:35,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:35,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:35,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:35,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:59:35,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:59:35,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:35,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:35,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,396 INFO L478 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 33 treesize of output 75 [2019-02-15 10:59:35,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,407 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:35,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:59:35,424 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,466 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,499 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,524 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,561 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:35,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:35,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:35,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:35,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:59:35,837 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,864 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,891 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,916 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,944 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,992 INFO L267 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-15 10:59:35,992 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 10:59:36,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:59:36,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:36,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:36,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:36,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,129 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:36,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-02-15 10:59:36,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:36,176 INFO L267 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-15 10:59:36,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-02-15 10:59:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:36,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:36,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:36,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:59:36,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:36,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:59:36,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:59:36,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:59:36,239 INFO L87 Difference]: Start difference. First operand 176 states and 1188 transitions. Second operand 8 states. [2019-02-15 10:59:36,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:36,689 INFO L93 Difference]: Finished difference Result 201 states and 1233 transitions. [2019-02-15 10:59:36,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:59:36,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:59:36,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:36,693 INFO L225 Difference]: With dead ends: 201 [2019-02-15 10:59:36,693 INFO L226 Difference]: Without dead ends: 200 [2019-02-15 10:59:36,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:59:36,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-02-15 10:59:36,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 178. [2019-02-15 10:59:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-15 10:59:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 1204 transitions. [2019-02-15 10:59:36,770 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 1204 transitions. Word has length 5 [2019-02-15 10:59:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:36,770 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 1204 transitions. [2019-02-15 10:59:36,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:59:36,770 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 1204 transitions. [2019-02-15 10:59:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:36,771 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:36,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:36,771 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:36,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:36,772 INFO L82 PathProgramCache]: Analyzing trace with hash 29302192, now seen corresponding path program 1 times [2019-02-15 10:59:36,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:36,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:36,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:36,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:36,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:36,916 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 10:59:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:36,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:36,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:36,939 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:36,939 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [31] [2019-02-15 10:59:36,940 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:36,940 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:36,942 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:36,943 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:36,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:36,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:36,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:36,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:36,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:36,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:36,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:36,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:59:36,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:59:36,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:37,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:37,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,015 INFO L478 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 33 treesize of output 75 [2019-02-15 10:59:37,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,029 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:37,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:59:37,041 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,083 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,116 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,141 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,177 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:37,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:37,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:37,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:37,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:59:37,448 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,475 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,502 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,527 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,554 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:37,605 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 10:59:37,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:59:37,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:37,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:37,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-02-15 10:59:37,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:37,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-15 10:59:37,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,827 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:37,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-02-15 10:59:37,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,882 INFO L267 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-15 10:59:37,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 10:59:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:37,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:37,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:37,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:37,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:59:37,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:37,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:59:37,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:59:37,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:59:37,960 INFO L87 Difference]: Start difference. First operand 178 states and 1204 transitions. Second operand 10 states. [2019-02-15 10:59:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:38,762 INFO L93 Difference]: Finished difference Result 245 states and 1358 transitions. [2019-02-15 10:59:38,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:38,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:59:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:38,766 INFO L225 Difference]: With dead ends: 245 [2019-02-15 10:59:38,766 INFO L226 Difference]: Without dead ends: 243 [2019-02-15 10:59:38,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:59:38,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-15 10:59:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 191. [2019-02-15 10:59:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-15 10:59:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1287 transitions. [2019-02-15 10:59:38,873 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1287 transitions. Word has length 5 [2019-02-15 10:59:38,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:38,874 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1287 transitions. [2019-02-15 10:59:38,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1287 transitions. [2019-02-15 10:59:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:38,875 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:38,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:38,875 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:38,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:38,875 INFO L82 PathProgramCache]: Analyzing trace with hash 29295188, now seen corresponding path program 1 times [2019-02-15 10:59:38,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:38,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:38,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:38,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:38,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:39,308 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-02-15 10:59:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:39,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:39,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:39,526 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:39,526 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [32], [33] [2019-02-15 10:59:39,528 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:39,528 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:39,530 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:39,530 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:39,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:39,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:39,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:39,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:39,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:39,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:39,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:39,777 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 10:59:39,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:39,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:39,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:39,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:40,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:59:40,014 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,041 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,095 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,160 INFO L478 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 24 treesize of output 27 [2019-02-15 10:59:40,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:59:40,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:40,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:40,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:59:40,175 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:40,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:59:40,184 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,222 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,253 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,274 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,293 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,309 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,324 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:40,374 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 10:59:40,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:59:40,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,465 INFO L267 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-15 10:59:40,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:40,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-02-15 10:59:40,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,547 INFO L267 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-15 10:59:40,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-15 10:59:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:40,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:40,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:40,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-02-15 10:59:40,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:40,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:59:40,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:59:40,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:59:40,593 INFO L87 Difference]: Start difference. First operand 191 states and 1287 transitions. Second operand 8 states. [2019-02-15 10:59:40,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:40,988 INFO L93 Difference]: Finished difference Result 343 states and 2333 transitions. [2019-02-15 10:59:40,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:40,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:59:40,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:40,993 INFO L225 Difference]: With dead ends: 343 [2019-02-15 10:59:40,993 INFO L226 Difference]: Without dead ends: 342 [2019-02-15 10:59:40,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:59:40,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-02-15 10:59:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 304. [2019-02-15 10:59:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-02-15 10:59:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 2201 transitions. [2019-02-15 10:59:41,125 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 2201 transitions. Word has length 5 [2019-02-15 10:59:41,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:41,125 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 2201 transitions. [2019-02-15 10:59:41,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:59:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 2201 transitions. [2019-02-15 10:59:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:41,126 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:41,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:41,126 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:41,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:41,127 INFO L82 PathProgramCache]: Analyzing trace with hash 29295000, now seen corresponding path program 1 times [2019-02-15 10:59:41,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:41,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:41,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:41,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:41,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:41,537 WARN L181 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-02-15 10:59:41,874 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-02-15 10:59:42,068 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-02-15 10:59:42,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:42,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:42,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:42,192 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:42,193 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [26], [31] [2019-02-15 10:59:42,194 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:42,194 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:42,196 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:42,196 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:42,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:42,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:42,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:42,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:42,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:42,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:42,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:42,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:59:42,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:59:42,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:42,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:42,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,354 INFO L478 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 33 treesize of output 75 [2019-02-15 10:59:42,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,366 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:42,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:59:42,378 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:42,421 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:42,454 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:42,479 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:42,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:42,515 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:42,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:42,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:42,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:42,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:42,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:42,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:59:42,788 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:42,813 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:42,840 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:42,867 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:42,894 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:42,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:42,944 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 10:59:43,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:59:43,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:43,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:43,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:43,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-02-15 10:59:43,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:43,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:43,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-15 10:59:43,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,186 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:43,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 134 [2019-02-15 10:59:43,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:43,243 INFO L267 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-15 10:59:43,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-15 10:59:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:43,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:43,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:43,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:59:43,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:43,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:59:43,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:59:43,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:59:43,326 INFO L87 Difference]: Start difference. First operand 304 states and 2201 transitions. Second operand 10 states. [2019-02-15 10:59:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:45,062 INFO L93 Difference]: Finished difference Result 369 states and 2390 transitions. [2019-02-15 10:59:45,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:45,063 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:59:45,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:45,068 INFO L225 Difference]: With dead ends: 369 [2019-02-15 10:59:45,068 INFO L226 Difference]: Without dead ends: 367 [2019-02-15 10:59:45,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:59:45,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-02-15 10:59:45,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 320. [2019-02-15 10:59:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-02-15 10:59:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 2329 transitions. [2019-02-15 10:59:45,200 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 2329 transitions. Word has length 5 [2019-02-15 10:59:45,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:45,200 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 2329 transitions. [2019-02-15 10:59:45,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 2329 transitions. [2019-02-15 10:59:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:45,201 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:45,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:45,201 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:45,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:45,201 INFO L82 PathProgramCache]: Analyzing trace with hash 29312486, now seen corresponding path program 1 times [2019-02-15 10:59:45,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:45,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:45,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:45,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:45,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:45,570 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-02-15 10:59:45,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:45,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:45,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:45,581 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:45,582 INFO L207 CegarAbsIntRunner]: [0], [22], [28], [32], [33] [2019-02-15 10:59:45,582 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:45,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:45,585 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:45,585 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:45,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:45,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:45,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:45,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:45,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:45,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:45,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:45,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 10:59:45,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 10:59:45,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 10:59:45,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 10:59:45,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 10:59:45,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:45,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 85 [2019-02-15 10:59:46,008 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,064 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,111 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,205 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,319 INFO L478 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 24 treesize of output 27 [2019-02-15 10:59:46,321 INFO L478 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 27 treesize of output 33 [2019-02-15 10:59:46,323 INFO L478 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 29 treesize of output 43 [2019-02-15 10:59:46,326 INFO L478 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 31 treesize of output 57 [2019-02-15 10:59:46,328 INFO L478 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 33 treesize of output 75 [2019-02-15 10:59:46,331 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:46,334 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 10:59:46,334 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,387 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,418 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,442 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,461 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,477 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,492 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,561 INFO L267 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-15 10:59:46,562 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-15 10:59:46,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,590 INFO L478 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 126 [2019-02-15 10:59:46,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,673 INFO L267 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-15 10:59:46,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-15 10:59:46,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,770 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:46,771 INFO L478 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 134 [2019-02-15 10:59:46,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,839 INFO L267 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-15 10:59:46,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:80 [2019-02-15 10:59:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:46,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:46,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:46,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:46,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:59:46,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:46,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:59:46,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:59:46,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:59:46,921 INFO L87 Difference]: Start difference. First operand 320 states and 2329 transitions. Second operand 8 states. [2019-02-15 10:59:47,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:47,601 INFO L93 Difference]: Finished difference Result 354 states and 2377 transitions. [2019-02-15 10:59:47,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:59:47,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:59:47,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:47,604 INFO L225 Difference]: With dead ends: 354 [2019-02-15 10:59:47,604 INFO L226 Difference]: Without dead ends: 350 [2019-02-15 10:59:47,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-15 10:59:47,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-02-15 10:59:47,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 323. [2019-02-15 10:59:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-02-15 10:59:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 2346 transitions. [2019-02-15 10:59:47,733 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 2346 transitions. Word has length 5 [2019-02-15 10:59:47,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:47,733 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 2346 transitions. [2019-02-15 10:59:47,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:59:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 2346 transitions. [2019-02-15 10:59:47,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:47,734 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:47,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:47,734 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:47,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:47,734 INFO L82 PathProgramCache]: Analyzing trace with hash 29299032, now seen corresponding path program 1 times [2019-02-15 10:59:47,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:47,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:47,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:47,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:47,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:47,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:47,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:47,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:47,817 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [32], [33] [2019-02-15 10:59:47,819 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:47,819 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:47,821 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:47,821 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:47,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:47,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:47,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:47,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:47,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:47,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:47,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:47,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:59:47,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:59:47,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:47,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:47,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,894 INFO L478 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 33 treesize of output 75 [2019-02-15 10:59:47,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,904 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:47,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:59:47,925 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:47,967 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:48,001 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:48,028 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:48,050 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:48,067 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:48,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:48,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:48,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:48,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:48,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:48,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:59:48,335 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:48,360 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:48,387 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:48,414 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:48,441 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:48,491 INFO L267 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-15 10:59:48,492 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 10:59:48,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:59:48,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:48,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:48,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:48,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:48,617 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:48,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-02-15 10:59:48,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:48,665 INFO L267 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-15 10:59:48,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-02-15 10:59:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:48,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:48,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:48,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:59:48,739 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:48,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:59:48,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:59:48,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:59:48,739 INFO L87 Difference]: Start difference. First operand 323 states and 2346 transitions. Second operand 8 states. [2019-02-15 10:59:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:49,368 INFO L93 Difference]: Finished difference Result 347 states and 2375 transitions. [2019-02-15 10:59:49,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:59:49,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:59:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:49,374 INFO L225 Difference]: With dead ends: 347 [2019-02-15 10:59:49,374 INFO L226 Difference]: Without dead ends: 346 [2019-02-15 10:59:49,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:59:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-02-15 10:59:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 324. [2019-02-15 10:59:49,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-02-15 10:59:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 2354 transitions. [2019-02-15 10:59:49,507 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 2354 transitions. Word has length 5 [2019-02-15 10:59:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:49,508 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 2354 transitions. [2019-02-15 10:59:49,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:59:49,508 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 2354 transitions. [2019-02-15 10:59:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:49,509 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:49,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:49,509 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:49,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:49,510 INFO L82 PathProgramCache]: Analyzing trace with hash 28958902, now seen corresponding path program 1 times [2019-02-15 10:59:49,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:49,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:49,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:49,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:49,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:49,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:49,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:49,566 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:49,566 INFO L207 CegarAbsIntRunner]: [0], [10], [32], [34], [35] [2019-02-15 10:59:49,568 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:49,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:49,570 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:49,570 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:59:49,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:49,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:49,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:49,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:49,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:49,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:49,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:49,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:49,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:49,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:49,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:49,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:59:49,872 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:49,913 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:49,953 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:49,986 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:50,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:50,072 INFO L478 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 24 treesize of output 27 [2019-02-15 10:59:50,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:59:50,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:50,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:50,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:59:50,086 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:50,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:59:50,097 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:50,137 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:50,168 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:50,192 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:50,210 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:50,226 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:50,241 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:50,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:50,289 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 10:59:50,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:50,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:59:50,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:50,372 INFO L267 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-15 10:59:50,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:50,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:50,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:50,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:59:50,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:50,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:59:50,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:59:50,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:59:50,422 INFO L87 Difference]: Start difference. First operand 324 states and 2354 transitions. Second operand 6 states. [2019-02-15 10:59:50,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:50,739 INFO L93 Difference]: Finished difference Result 344 states and 2373 transitions. [2019-02-15 10:59:50,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:59:50,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-15 10:59:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:50,745 INFO L225 Difference]: With dead ends: 344 [2019-02-15 10:59:50,745 INFO L226 Difference]: Without dead ends: 343 [2019-02-15 10:59:50,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:59:50,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-02-15 10:59:50,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 324. [2019-02-15 10:59:50,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-02-15 10:59:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 2354 transitions. [2019-02-15 10:59:50,873 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 2354 transitions. Word has length 5 [2019-02-15 10:59:50,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:50,874 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 2354 transitions. [2019-02-15 10:59:50,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:59:50,874 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 2354 transitions. [2019-02-15 10:59:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:50,874 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:50,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:50,875 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:50,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:50,875 INFO L82 PathProgramCache]: Analyzing trace with hash 28945258, now seen corresponding path program 1 times [2019-02-15 10:59:50,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:50,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:50,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:50,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:50,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:51,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:51,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:51,012 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:51,012 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [31] [2019-02-15 10:59:51,013 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:51,014 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:51,015 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:51,015 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:51,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:51,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:51,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:51,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:51,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:51,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:51,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:51,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:59:51,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:59:51,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:51,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:51,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,104 INFO L478 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 33 treesize of output 75 [2019-02-15 10:59:51,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,112 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:51,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 10:59:51,124 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:51,166 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:51,198 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:51,222 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:51,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:51,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:51,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:51,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:51,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:51,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:51,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:51,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 10:59:51,534 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:51,560 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:51,587 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:51,612 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:51,640 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:51,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:51,687 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 10:59:51,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 106 [2019-02-15 10:59:51,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:59:51,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 10:59:51,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:150 [2019-02-15 10:59:51,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,991 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:52,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 117 [2019-02-15 10:59:52,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:59:52,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,232 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:52,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 130 [2019-02-15 10:59:52,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:52,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-02-15 10:59:52,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:189 [2019-02-15 10:59:52,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,530 INFO L478 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 8 case distinctions, treesize of input 78 treesize of output 152 [2019-02-15 10:59:52,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 10:59:53,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:53,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:53,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:53,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:53,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:53,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:53,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:53,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:53,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:53,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:53,053 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:53,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 103 [2019-02-15 10:59:53,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:53,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-02-15 10:59:53,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:346 [2019-02-15 10:59:53,497 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 109 [2019-02-15 10:59:53,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:53,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:53,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:53,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:59:53,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:53,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:59:53,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:59:53,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:59:53,592 INFO L87 Difference]: Start difference. First operand 324 states and 2354 transitions. Second operand 10 states. [2019-02-15 10:59:53,759 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 89 [2019-02-15 10:59:57,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:57,274 INFO L93 Difference]: Finished difference Result 434 states and 2876 transitions. [2019-02-15 10:59:57,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:59:57,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:59:57,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:57,280 INFO L225 Difference]: With dead ends: 434 [2019-02-15 10:59:57,280 INFO L226 Difference]: Without dead ends: 432 [2019-02-15 10:59:57,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:59:57,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-02-15 10:59:57,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 339. [2019-02-15 10:59:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-02-15 10:59:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 2453 transitions. [2019-02-15 10:59:57,414 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 2453 transitions. Word has length 5 [2019-02-15 10:59:57,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:57,414 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 2453 transitions. [2019-02-15 10:59:57,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 2453 transitions. [2019-02-15 10:59:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:57,415 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:57,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:57,415 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:57,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:57,416 INFO L82 PathProgramCache]: Analyzing trace with hash 28933852, now seen corresponding path program 2 times [2019-02-15 10:59:57,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:57,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:57,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:57,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:57,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:57,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:57,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:57,475 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:59:57,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:59:57,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:57,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:57,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:59:57,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:59:57,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 10:59:57,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:59:57,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:57,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 10:59:57,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 10:59:57,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:57,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:57,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,547 INFO L478 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 33 treesize of output 75 [2019-02-15 10:59:57,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,557 INFO L478 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 35 treesize of output 97 [2019-02-15 10:59:57,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,569 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 10:59:57,570 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,630 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,666 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,691 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,732 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 10:59:57,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 10:59:57,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 10:59:57,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 10:59:58,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 10:59:58,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 85 [2019-02-15 10:59:58,148 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,194 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,235 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,277 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,318 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,360 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:58,440 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:118, output treesize:120 [2019-02-15 10:59:58,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,464 INFO L478 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 126 [2019-02-15 10:59:58,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,534 INFO L267 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-15 10:59:58,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-15 10:59:58,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,567 INFO L478 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 142 [2019-02-15 10:59:58,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,638 INFO L267 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-15 10:59:58,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-02-15 10:59:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:58,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:58,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:58,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:59:58,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:58,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:59:58,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:59:58,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:59:58,696 INFO L87 Difference]: Start difference. First operand 339 states and 2453 transitions. Second operand 8 states. [2019-02-15 10:59:59,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:59,889 INFO L93 Difference]: Finished difference Result 472 states and 3201 transitions. [2019-02-15 10:59:59,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:59:59,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:59:59,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:59,896 INFO L225 Difference]: With dead ends: 472 [2019-02-15 10:59:59,896 INFO L226 Difference]: Without dead ends: 471 [2019-02-15 10:59:59,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:59:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-02-15 11:00:00,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 396. [2019-02-15 11:00:00,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-02-15 11:00:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 2917 transitions. [2019-02-15 11:00:00,068 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 2917 transitions. Word has length 5 [2019-02-15 11:00:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:00,068 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 2917 transitions. [2019-02-15 11:00:00,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:00:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 2917 transitions. [2019-02-15 11:00:00,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:00:00,069 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:00,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:00:00,069 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:00,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:00,069 INFO L82 PathProgramCache]: Analyzing trace with hash 28952946, now seen corresponding path program 1 times [2019-02-15 11:00:00,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:00,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:00,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:00:00,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:00,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:00,343 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 17 [2019-02-15 11:00:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:00,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:00,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:00,428 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:00:00,428 INFO L207 CegarAbsIntRunner]: [0], [10], [26], [28], [31] [2019-02-15 11:00:00,429 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:00,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:00,432 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:00,432 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:00:00,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:00,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:00,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:00,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:00,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:00,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:00,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:00,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:00:00,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:00:00,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:00:00,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:00:00,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,541 INFO L478 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 33 treesize of output 75 [2019-02-15 11:00:00,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,551 INFO L478 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 35 treesize of output 97 [2019-02-15 11:00:00,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 11:00:00,565 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:00,608 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:00,641 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:00,667 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:00,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:00,703 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:00,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:00,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:00:00,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:00:00,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:00:00,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:00:00,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 11:00:00,972 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:00,999 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:01,026 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:01,053 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:01,080 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:01,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:01,132 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 11:00:01,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 106 [2019-02-15 11:00:01,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:00:01,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:00:01,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:150 [2019-02-15 11:00:01,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,409 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:01,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 128 [2019-02-15 11:00:01,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:01,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,534 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:01,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 133 [2019-02-15 11:00:01,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-15 11:00:01,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-02-15 11:00:01,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:189 [2019-02-15 11:00:01,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,920 INFO L478 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 8 case distinctions, treesize of input 78 treesize of output 136 [2019-02-15 11:00:01,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 11:00:02,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:02,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:02,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:02,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:02,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:02,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:02,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:02,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:02,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:02,395 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:02,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 109 [2019-02-15 11:00:02,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:02,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-02-15 11:00:02,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:346 [2019-02-15 11:00:04,466 WARN L181 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 211 DAG size of output: 109 [2019-02-15 11:00:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:04,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:04,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:04,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:00:04,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:04,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:00:04,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:00:04,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:00:04,538 INFO L87 Difference]: Start difference. First operand 396 states and 2917 transitions. Second operand 10 states. [2019-02-15 11:00:04,699 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2019-02-15 11:00:04,866 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 88 [2019-02-15 11:00:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:06,263 INFO L93 Difference]: Finished difference Result 485 states and 3298 transitions. [2019-02-15 11:00:06,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:00:06,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:00:06,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:06,270 INFO L225 Difference]: With dead ends: 485 [2019-02-15 11:00:06,270 INFO L226 Difference]: Without dead ends: 484 [2019-02-15 11:00:06,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:00:06,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-02-15 11:00:06,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 400. [2019-02-15 11:00:06,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-02-15 11:00:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 2949 transitions. [2019-02-15 11:00:06,465 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 2949 transitions. Word has length 5 [2019-02-15 11:00:06,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:06,465 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 2949 transitions. [2019-02-15 11:00:06,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:00:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 2949 transitions. [2019-02-15 11:00:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:00:06,467 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:06,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:00:06,467 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:06,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:06,468 INFO L82 PathProgramCache]: Analyzing trace with hash 28954558, now seen corresponding path program 2 times [2019-02-15 11:00:06,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:06,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:06,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:06,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:06,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:06,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:06,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:06,604 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:00:06,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:00:06,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:06,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:06,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:00:06,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:00:06,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:00:06,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:00:06,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:06,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:00:06,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:00:06,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:00:06,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:00:06,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,675 INFO L478 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 33 treesize of output 75 [2019-02-15 11:00:06,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,685 INFO L478 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 35 treesize of output 97 [2019-02-15 11:00:06,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,697 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 11:00:06,698 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:06,761 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:06,796 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:06,824 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:06,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:06,864 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:06,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:06,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 11:00:06,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:06,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 11:00:07,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 11:00:07,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 11:00:07,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 11:00:07,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 85 [2019-02-15 11:00:07,286 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,336 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,376 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,418 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,460 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,502 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:07,572 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-15 11:00:07,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,611 INFO L478 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 126 [2019-02-15 11:00:07,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:07,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-15 11:00:07,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,723 INFO L478 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 142 [2019-02-15 11:00:07,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,792 INFO L267 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-15 11:00:07,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-15 11:00:07,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,842 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:07,843 INFO L478 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 153 [2019-02-15 11:00:07,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,914 INFO L267 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-15 11:00:07,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2019-02-15 11:00:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:07,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:07,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:07,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:00:07,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:07,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:00:07,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:00:07,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:00:07,999 INFO L87 Difference]: Start difference. First operand 400 states and 2949 transitions. Second operand 10 states. [2019-02-15 11:00:09,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:09,171 INFO L93 Difference]: Finished difference Result 485 states and 3293 transitions. [2019-02-15 11:00:09,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:00:09,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:00:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:09,177 INFO L225 Difference]: With dead ends: 485 [2019-02-15 11:00:09,178 INFO L226 Difference]: Without dead ends: 480 [2019-02-15 11:00:09,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:00:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-02-15 11:00:09,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 435. [2019-02-15 11:00:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-02-15 11:00:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 3230 transitions. [2019-02-15 11:00:09,344 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 3230 transitions. Word has length 5 [2019-02-15 11:00:09,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:09,344 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 3230 transitions. [2019-02-15 11:00:09,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:00:09,344 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 3230 transitions. [2019-02-15 11:00:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:00:09,346 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:09,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:00:09,346 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:09,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:09,346 INFO L82 PathProgramCache]: Analyzing trace with hash 28954806, now seen corresponding path program 2 times [2019-02-15 11:00:09,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:09,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:09,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:00:09,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:09,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:09,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:09,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:09,415 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:00:09,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:00:09,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:09,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:09,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:00:09,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:00:09,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:00:09,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:00:09,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:09,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:00:09,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:00:09,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:00:09,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:00:09,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,489 INFO L478 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 33 treesize of output 75 [2019-02-15 11:00:09,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,501 INFO L478 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 35 treesize of output 97 [2019-02-15 11:00:09,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,511 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 11:00:09,512 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:09,570 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:09,605 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:09,631 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:09,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:09,669 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:09,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:09,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 11:00:09,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 11:00:09,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 11:00:09,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 11:00:09,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 11:00:10,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 85 [2019-02-15 11:00:10,083 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:10,137 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:10,178 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:10,219 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:10,261 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:10,304 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:10,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:10,374 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-15 11:00:10,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,414 INFO L478 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 126 [2019-02-15 11:00:10,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:10,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:10,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-15 11:00:10,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,525 INFO L478 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 142 [2019-02-15 11:00:10,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:10,593 INFO L267 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-15 11:00:10,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-15 11:00:10,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:10,685 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:10,686 INFO L478 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 163 [2019-02-15 11:00:10,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:10,773 INFO L267 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-15 11:00:10,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2019-02-15 11:00:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:10,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:10,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:10,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:00:10,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:10,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:00:10,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:00:10,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:00:10,859 INFO L87 Difference]: Start difference. First operand 435 states and 3230 transitions. Second operand 10 states. [2019-02-15 11:00:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:11,684 INFO L93 Difference]: Finished difference Result 501 states and 3456 transitions. [2019-02-15 11:00:11,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:00:11,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:00:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:11,690 INFO L225 Difference]: With dead ends: 501 [2019-02-15 11:00:11,690 INFO L226 Difference]: Without dead ends: 499 [2019-02-15 11:00:11,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:00:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-02-15 11:00:11,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 457. [2019-02-15 11:00:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-02-15 11:00:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 3406 transitions. [2019-02-15 11:00:11,849 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 3406 transitions. Word has length 5 [2019-02-15 11:00:11,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:11,849 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 3406 transitions. [2019-02-15 11:00:11,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:00:11,849 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 3406 transitions. [2019-02-15 11:00:11,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:00:11,850 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:11,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:00:11,850 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:11,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:11,851 INFO L82 PathProgramCache]: Analyzing trace with hash 28941104, now seen corresponding path program 1 times [2019-02-15 11:00:11,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:11,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:11,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:00:11,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:11,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:11,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:11,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:11,941 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:00:11,941 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [31] [2019-02-15 11:00:11,941 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:11,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:11,944 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:11,945 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:00:11,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:11,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:11,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:11,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:11,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:11,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:11,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:11,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:00:11,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:00:11,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:11,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:11,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:00:12,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:00:12,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,051 INFO L478 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 33 treesize of output 75 [2019-02-15 11:00:12,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,082 INFO L478 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 35 treesize of output 97 [2019-02-15 11:00:12,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 11:00:12,096 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,137 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,169 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,190 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,227 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:00:12,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:00:12,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:00:12,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:00:12,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 11:00:12,502 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,527 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,553 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,580 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,608 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:12,659 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 11:00:12,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:00:12,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:12,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:00:12,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 11:00:12,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:12,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 11:00:12,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:12,903 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:12,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-02-15 11:00:12,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:12,956 INFO L267 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-15 11:00:12,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-15 11:00:12,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:12,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:13,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:13,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:00:13,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:13,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:00:13,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:00:13,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:00:13,048 INFO L87 Difference]: Start difference. First operand 457 states and 3406 transitions. Second operand 10 states. [2019-02-15 11:00:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:14,005 INFO L93 Difference]: Finished difference Result 539 states and 3726 transitions. [2019-02-15 11:00:14,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:00:14,006 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:00:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:14,012 INFO L225 Difference]: With dead ends: 539 [2019-02-15 11:00:14,012 INFO L226 Difference]: Without dead ends: 537 [2019-02-15 11:00:14,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:00:14,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-02-15 11:00:14,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 492. [2019-02-15 11:00:14,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-02-15 11:00:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 3666 transitions. [2019-02-15 11:00:14,183 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 3666 transitions. Word has length 5 [2019-02-15 11:00:14,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:14,183 INFO L480 AbstractCegarLoop]: Abstraction has 492 states and 3666 transitions. [2019-02-15 11:00:14,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:00:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 3666 transitions. [2019-02-15 11:00:14,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:00:14,185 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:14,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:00:14,185 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:14,186 INFO L82 PathProgramCache]: Analyzing trace with hash 28941352, now seen corresponding path program 1 times [2019-02-15 11:00:14,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:14,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:14,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:14,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:14,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:14,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:14,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:14,295 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:00:14,295 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [26], [31] [2019-02-15 11:00:14,296 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:14,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:14,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:14,299 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:00:14,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:14,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:14,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:14,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:14,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:14,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:14,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:14,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:00:14,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:00:14,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:00:14,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:00:14,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:14,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 11:00:14,566 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:14,595 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:14,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:14,648 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:14,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:14,707 INFO L478 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 24 treesize of output 27 [2019-02-15 11:00:14,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:00:14,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:00:14,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:00:14,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:00:14,742 INFO L478 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 35 treesize of output 97 [2019-02-15 11:00:14,890 INFO L303 Elim1Store]: Index analysis took 145 ms [2019-02-15 11:00:14,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 11:00:14,891 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:15,086 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:15,118 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:15,143 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:15,162 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:15,178 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:15,192 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:15,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:15,243 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 11:00:15,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:00:15,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:15,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:15,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:00:15,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 11:00:15,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:15,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:15,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 11:00:15,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:15,523 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:15,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 128 [2019-02-15 11:00:15,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:15,576 INFO L267 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-15 11:00:15,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-15 11:00:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:15,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:15,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:15,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:00:15,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:15,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:00:15,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:00:15,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:00:15,657 INFO L87 Difference]: Start difference. First operand 492 states and 3666 transitions. Second operand 10 states. [2019-02-15 11:00:16,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:16,454 INFO L93 Difference]: Finished difference Result 551 states and 3869 transitions. [2019-02-15 11:00:16,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:00:16,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:00:16,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:16,463 INFO L225 Difference]: With dead ends: 551 [2019-02-15 11:00:16,463 INFO L226 Difference]: Without dead ends: 549 [2019-02-15 11:00:16,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:00:16,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-02-15 11:00:16,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 509. [2019-02-15 11:00:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-02-15 11:00:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 3822 transitions. [2019-02-15 11:00:16,625 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 3822 transitions. Word has length 5 [2019-02-15 11:00:16,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:16,625 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 3822 transitions. [2019-02-15 11:00:16,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:00:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 3822 transitions. [2019-02-15 11:00:16,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:00:16,627 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:16,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:00:16,627 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:16,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:16,628 INFO L82 PathProgramCache]: Analyzing trace with hash 29435558, now seen corresponding path program 1 times [2019-02-15 11:00:16,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:16,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:16,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:16,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:16,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:16,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:16,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:16,683 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:00:16,684 INFO L207 CegarAbsIntRunner]: [0], [26], [32], [34], [35] [2019-02-15 11:00:16,684 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:16,684 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:16,687 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:16,687 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 11:00:16,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:16,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:16,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:16,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:16,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:16,697 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:16,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:16,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 63 [2019-02-15 11:00:16,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2019-02-15 11:00:16,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2019-02-15 11:00:16,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 72 [2019-02-15 11:00:16,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2019-02-15 11:00:16,874 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:16,897 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:16,921 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:16,947 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:16,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:17,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:00:17,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 33 [2019-02-15 11:00:17,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-15 11:00:17,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2019-02-15 11:00:17,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:00:17,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-02-15 11:00:17,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 88 [2019-02-15 11:00:17,036 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:17,070 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:17,097 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:17,117 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:17,133 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:17,149 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:17,162 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:17,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:17,207 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:84, output treesize:88 [2019-02-15 11:00:17,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:17,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 89 [2019-02-15 11:00:17,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:17,286 INFO L267 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-15 11:00:17,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:93, output treesize:63 [2019-02-15 11:00:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:17,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:17,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:17,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:17,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:00:17,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:17,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:00:17,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:00:17,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:00:17,538 INFO L87 Difference]: Start difference. First operand 509 states and 3822 transitions. Second operand 6 states. [2019-02-15 11:00:17,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:17,943 INFO L93 Difference]: Finished difference Result 523 states and 3832 transitions. [2019-02-15 11:00:17,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:00:17,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-15 11:00:17,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:17,949 INFO L225 Difference]: With dead ends: 523 [2019-02-15 11:00:17,949 INFO L226 Difference]: Without dead ends: 522 [2019-02-15 11:00:17,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:00:17,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-02-15 11:00:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 509. [2019-02-15 11:00:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-02-15 11:00:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 3821 transitions. [2019-02-15 11:00:18,113 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 3821 transitions. Word has length 5 [2019-02-15 11:00:18,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:18,113 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 3821 transitions. [2019-02-15 11:00:18,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:00:18,113 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 3821 transitions. [2019-02-15 11:00:18,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:00:18,114 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:18,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:00:18,114 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:18,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:18,115 INFO L82 PathProgramCache]: Analyzing trace with hash 29425884, now seen corresponding path program 1 times [2019-02-15 11:00:18,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:18,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:18,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:18,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:18,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:18,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:18,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:18,252 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:00:18,252 INFO L207 CegarAbsIntRunner]: [0], [22], [26], [32], [33] [2019-02-15 11:00:18,253 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:18,253 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:18,255 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:18,255 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:00:18,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:18,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:18,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:18,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:18,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:18,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:18,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:18,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:00:18,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:00:18,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:00:18,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:00:18,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 11:00:18,551 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,578 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,631 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,689 INFO L478 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 24 treesize of output 27 [2019-02-15 11:00:18,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:00:18,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:00:18,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:00:18,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:00:18,706 INFO L478 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 35 treesize of output 97 [2019-02-15 11:00:18,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 11:00:18,714 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,753 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,783 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,807 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,826 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,841 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,856 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,907 INFO L267 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-15 11:00:18,907 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:00:18,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:00:18,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:19,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:19,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:00:19,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 11:00:19,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:19,118 INFO L267 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-15 11:00:19,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-15 11:00:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:19,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:19,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:19,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:00:19,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:19,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:00:19,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:00:19,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:00:19,180 INFO L87 Difference]: Start difference. First operand 509 states and 3821 transitions. Second operand 8 states. [2019-02-15 11:00:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:19,861 INFO L93 Difference]: Finished difference Result 542 states and 3850 transitions. [2019-02-15 11:00:19,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:00:19,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:00:19,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:19,867 INFO L225 Difference]: With dead ends: 542 [2019-02-15 11:00:19,867 INFO L226 Difference]: Without dead ends: 540 [2019-02-15 11:00:19,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:00:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-02-15 11:00:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 509. [2019-02-15 11:00:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-02-15 11:00:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 3820 transitions. [2019-02-15 11:00:20,032 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 3820 transitions. Word has length 5 [2019-02-15 11:00:20,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:20,033 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 3820 transitions. [2019-02-15 11:00:20,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:00:20,033 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 3820 transitions. [2019-02-15 11:00:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:00:20,034 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:20,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:00:20,034 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:20,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:20,035 INFO L82 PathProgramCache]: Analyzing trace with hash 29431650, now seen corresponding path program 1 times [2019-02-15 11:00:20,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:20,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:20,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:20,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:20,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:20,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-15 11:00:20,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:20,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:20,085 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:00:20,085 INFO L207 CegarAbsIntRunner]: [0], [26], [28], [32], [33] [2019-02-15 11:00:20,086 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:20,086 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:20,088 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:20,088 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:00:20,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:20,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:20,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:20,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:20,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:20,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:20,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:20,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:00:20,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:00:20,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:00:20,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:00:20,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,155 INFO L478 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 33 treesize of output 75 [2019-02-15 11:00:20,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,165 INFO L478 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 35 treesize of output 97 [2019-02-15 11:00:20,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,177 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 11:00:20,178 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:20,257 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:20,289 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:20,316 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:20,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:20,356 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:20,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:20,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 11:00:20,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 11:00:20,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 11:00:20,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 11:00:20,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 11:00:20,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:20,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 85 [2019-02-15 11:00:20,771 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:20,822 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:20,862 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:20,901 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:20,943 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:20,984 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:21,053 INFO L267 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-15 11:00:21,053 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-15 11:00:21,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,083 INFO L478 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 126 [2019-02-15 11:00:21,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:21,154 INFO L267 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-15 11:00:21,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-15 11:00:21,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,191 INFO L478 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 142 [2019-02-15 11:00:21,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:21,261 INFO L267 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-15 11:00:21,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-02-15 11:00:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:21,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:21,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:21,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:00:21,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:21,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:00:21,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:00:21,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:00:21,340 INFO L87 Difference]: Start difference. First operand 509 states and 3820 transitions. Second operand 8 states. [2019-02-15 11:00:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:22,128 INFO L93 Difference]: Finished difference Result 541 states and 3851 transitions. [2019-02-15 11:00:22,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:00:22,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:00:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:22,133 INFO L225 Difference]: With dead ends: 541 [2019-02-15 11:00:22,133 INFO L226 Difference]: Without dead ends: 540 [2019-02-15 11:00:22,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:00:22,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-02-15 11:00:22,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 509. [2019-02-15 11:00:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-02-15 11:00:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 3820 transitions. [2019-02-15 11:00:22,296 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 3820 transitions. Word has length 5 [2019-02-15 11:00:22,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:22,296 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 3820 transitions. [2019-02-15 11:00:22,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:00:22,296 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 3820 transitions. [2019-02-15 11:00:22,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:00:22,298 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:22,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:00:22,298 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:22,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:22,298 INFO L82 PathProgramCache]: Analyzing trace with hash 29418196, now seen corresponding path program 1 times [2019-02-15 11:00:22,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:22,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:22,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:22,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:22,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:22,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:22,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:22,406 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:00:22,406 INFO L207 CegarAbsIntRunner]: [0], [14], [26], [32], [33] [2019-02-15 11:00:22,408 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:22,408 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:22,409 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:22,410 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:00:22,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:22,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:22,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:22,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:22,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:22,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:22,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:22,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:00:22,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:00:22,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:00:22,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:00:22,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:22,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 11:00:22,675 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:22,704 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:22,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:22,759 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:22,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:22,825 INFO L478 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 24 treesize of output 27 [2019-02-15 11:00:22,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:00:22,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:00:22,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:00:22,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:00:22,843 INFO L478 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 35 treesize of output 97 [2019-02-15 11:00:22,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 11:00:22,852 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:22,891 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:22,922 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:22,944 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:22,963 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:22,979 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:22,993 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:23,044 INFO L267 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-15 11:00:23,044 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:00:23,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 11:00:23,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:23,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:23,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:00:23,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 11:00:23,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:23,266 INFO L267 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-15 11:00:23,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-15 11:00:23,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:23,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:23,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:23,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:00:23,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:23,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:00:23,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:00:23,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:00:23,333 INFO L87 Difference]: Start difference. First operand 509 states and 3820 transitions. Second operand 8 states. [2019-02-15 11:00:24,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:24,016 INFO L93 Difference]: Finished difference Result 573 states and 3948 transitions. [2019-02-15 11:00:24,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:00:24,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:00:24,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:24,021 INFO L225 Difference]: With dead ends: 573 [2019-02-15 11:00:24,021 INFO L226 Difference]: Without dead ends: 572 [2019-02-15 11:00:24,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:00:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-02-15 11:00:24,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 517. [2019-02-15 11:00:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-02-15 11:00:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 3892 transitions. [2019-02-15 11:00:24,186 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 3892 transitions. Word has length 5 [2019-02-15 11:00:24,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:24,187 INFO L480 AbstractCegarLoop]: Abstraction has 517 states and 3892 transitions. [2019-02-15 11:00:24,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:00:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 3892 transitions. [2019-02-15 11:00:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:00:24,188 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:24,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:00:24,188 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:24,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:24,188 INFO L82 PathProgramCache]: Analyzing trace with hash 29477778, now seen corresponding path program 1 times [2019-02-15 11:00:24,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:24,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:24,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:24,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:24,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:24,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:24,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:24,255 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:00:24,255 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [32], [33] [2019-02-15 11:00:24,256 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:24,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:24,258 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:24,258 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:00:24,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:24,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:24,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:24,259 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:24,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:24,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:24,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:24,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 11:00:24,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 11:00:24,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 11:00:24,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 11:00:24,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 11:00:24,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 85 [2019-02-15 11:00:24,701 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:24,750 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:24,798 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:24,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:24,901 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:24,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:25,010 INFO L478 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 24 treesize of output 27 [2019-02-15 11:00:25,013 INFO L478 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 27 treesize of output 33 [2019-02-15 11:00:25,031 INFO L478 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 29 treesize of output 43 [2019-02-15 11:00:25,050 INFO L478 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 31 treesize of output 57 [2019-02-15 11:00:25,067 INFO L478 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 33 treesize of output 75 [2019-02-15 11:00:25,085 INFO L478 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 35 treesize of output 97 [2019-02-15 11:00:25,104 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 11:00:25,104 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:25,172 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:25,204 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:25,228 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:25,248 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:25,264 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:25,277 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:25,348 INFO L267 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-15 11:00:25,349 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-15 11:00:25,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,380 INFO L478 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 126 [2019-02-15 11:00:25,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:25,448 INFO L267 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-15 11:00:25,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-15 11:00:25,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,486 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:25,487 INFO L478 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 134 [2019-02-15 11:00:25,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:25,557 INFO L267 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-15 11:00:25,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:80 [2019-02-15 11:00:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:25,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:25,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:25,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:00:25,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:25,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:00:25,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:00:25,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:00:25,634 INFO L87 Difference]: Start difference. First operand 517 states and 3892 transitions. Second operand 8 states. [2019-02-15 11:00:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:26,264 INFO L93 Difference]: Finished difference Result 560 states and 3946 transitions. [2019-02-15 11:00:26,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:00:26,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:00:26,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:26,268 INFO L225 Difference]: With dead ends: 560 [2019-02-15 11:00:26,269 INFO L226 Difference]: Without dead ends: 557 [2019-02-15 11:00:26,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:00:26,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-02-15 11:00:26,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 522. [2019-02-15 11:00:26,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2019-02-15 11:00:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 3906 transitions. [2019-02-15 11:00:26,431 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 3906 transitions. Word has length 5 [2019-02-15 11:00:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:26,431 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 3906 transitions. [2019-02-15 11:00:26,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:00:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 3906 transitions. [2019-02-15 11:00:26,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:26,432 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:26,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:26,433 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:26,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:26,433 INFO L82 PathProgramCache]: Analyzing trace with hash 905114198, now seen corresponding path program 1 times [2019-02-15 11:00:26,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:26,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:26,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:26,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:26,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:26,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:26,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:26,456 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:26,456 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [34], [36], [37] [2019-02-15 11:00:26,457 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:26,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:26,460 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:26,460 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 11:00:26,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:26,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:26,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:26,461 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:26,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:26,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:26,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:26,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:00:26,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:00:26,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-15 11:00:26,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2019-02-15 11:00:26,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:00:26,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-02-15 11:00:26,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 88 [2019-02-15 11:00:26,588 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:26,625 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:26,652 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:26,674 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:26,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:26,707 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:26,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:26,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 63 [2019-02-15 11:00:26,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2019-02-15 11:00:26,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2019-02-15 11:00:26,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 72 [2019-02-15 11:00:26,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:26,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2019-02-15 11:00:26,902 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:26,925 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:26,948 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:26,973 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:26,998 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:27,042 INFO L267 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-15 11:00:27,043 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:84, output treesize:88 [2019-02-15 11:00:27,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:27,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 83 [2019-02-15 11:00:27,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:27,108 INFO L267 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-15 11:00:27,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:93, output treesize:63 [2019-02-15 11:00:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:27,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:27,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 11:00:27,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 11:00:27,277 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:00:27,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:00:27,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:00:27,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:00:27,278 INFO L87 Difference]: Start difference. First operand 522 states and 3906 transitions. Second operand 4 states. [2019-02-15 11:00:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:27,720 INFO L93 Difference]: Finished difference Result 806 states and 6051 transitions. [2019-02-15 11:00:27,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:00:27,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-15 11:00:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:27,725 INFO L225 Difference]: With dead ends: 806 [2019-02-15 11:00:27,725 INFO L226 Difference]: Without dead ends: 802 [2019-02-15 11:00:27,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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-15 11:00:27,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-02-15 11:00:28,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 783. [2019-02-15 11:00:28,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-02-15 11:00:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 6028 transitions. [2019-02-15 11:00:28,048 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 6028 transitions. Word has length 6 [2019-02-15 11:00:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:28,048 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 6028 transitions. [2019-02-15 11:00:28,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:00:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 6028 transitions. [2019-02-15 11:00:28,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:28,050 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:28,050 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 11:00:28,050 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:28,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:28,050 INFO L82 PathProgramCache]: Analyzing trace with hash 904695138, now seen corresponding path program 2 times [2019-02-15 11:00:28,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:28,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:28,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:28,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:28,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:28,219 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2019-02-15 11:00:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:00:28,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:28,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:28,222 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:00:28,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:00:28,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:28,223 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:28,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:00:28,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:00:28,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 11:00:28,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:00:28,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:28,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:00:28,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:00:28,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-15 11:00:28,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2019-02-15 11:00:28,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:00:28,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-02-15 11:00:28,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 112 [2019-02-15 11:00:28,330 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:28,385 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:28,417 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:28,441 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:28,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:28,477 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:28,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:28,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 83 [2019-02-15 11:00:28,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2019-02-15 11:00:28,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 76 [2019-02-15 11:00:28,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 83 [2019-02-15 11:00:28,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 97 [2019-02-15 11:00:28,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:28,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 77 [2019-02-15 11:00:28,845 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:28,882 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:28,918 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:28,955 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:28,995 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:29,034 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:29,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:29,100 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:107, output treesize:112 [2019-02-15 11:00:29,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:29,128 INFO L478 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 46 treesize of output 112 [2019-02-15 11:00:29,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:29,190 INFO L267 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-15 11:00:29,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:122, output treesize:88 [2019-02-15 11:00:29,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:29,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:29,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:29,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:29,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:29,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:29,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:29,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:29,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:29,221 INFO L478 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 124 [2019-02-15 11:00:29,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:29,284 INFO L267 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-15 11:00:29,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:100, output treesize:88 [2019-02-15 11:00:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:29,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:29,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:29,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 11:00:29,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:29,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 11:00:29,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 11:00:29,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:00:29,343 INFO L87 Difference]: Start difference. First operand 783 states and 6028 transitions. Second operand 7 states. [2019-02-15 11:00:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:30,033 INFO L93 Difference]: Finished difference Result 802 states and 6046 transitions. [2019-02-15 11:00:30,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:00:30,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-15 11:00:30,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:30,040 INFO L225 Difference]: With dead ends: 802 [2019-02-15 11:00:30,040 INFO L226 Difference]: Without dead ends: 801 [2019-02-15 11:00:30,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:00:30,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-02-15 11:00:30,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 783. [2019-02-15 11:00:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-02-15 11:00:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 6028 transitions. [2019-02-15 11:00:30,365 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 6028 transitions. Word has length 6 [2019-02-15 11:00:30,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:30,366 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 6028 transitions. [2019-02-15 11:00:30,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 11:00:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 6028 transitions. [2019-02-15 11:00:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:30,368 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:30,368 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 11:00:30,368 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:30,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:30,368 INFO L82 PathProgramCache]: Analyzing trace with hash 904669900, now seen corresponding path program 1 times [2019-02-15 11:00:30,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:30,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:30,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:00:30,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:30,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:30,732 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-02-15 11:00:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:00:30,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:30,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:30,780 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:30,780 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [26], [31] [2019-02-15 11:00:30,781 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:30,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:30,783 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:30,783 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:00:30,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:30,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:30,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:30,784 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:30,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:30,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:30,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:30,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:00:30,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:00:30,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:00:30,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:00:30,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,859 INFO L478 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 33 treesize of output 75 [2019-02-15 11:00:30,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,882 INFO L478 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 35 treesize of output 97 [2019-02-15 11:00:30,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:30,896 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 11:00:30,897 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:30,958 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:30,991 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:31,015 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:31,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:31,054 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:31,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:31,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 11:00:31,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 11:00:31,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 11:00:31,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 11:00:31,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 11:00:31,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 85 [2019-02-15 11:00:31,476 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:31,517 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:31,558 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:31,600 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:31,660 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:31,702 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:31,772 INFO L267 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-15 11:00:31,773 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-15 11:00:31,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,806 INFO L478 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-15 11:00:31,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:31,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:31,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-15 11:00:31,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:31,913 INFO L478 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 132 [2019-02-15 11:00:31,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:31,988 INFO L267 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-15 11:00:31,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:96 [2019-02-15 11:00:32,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,028 INFO L478 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 142 [2019-02-15 11:00:32,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:32,102 INFO L267 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-15 11:00:32,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-15 11:00:32,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:32,149 INFO L478 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 48 treesize of output 164 [2019-02-15 11:00:32,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:32,231 INFO L267 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-15 11:00:32,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-02-15 11:00:32,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:32,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:32,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:32,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:32,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 11:00:32,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:32,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:00:32,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:00:32,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:00:32,324 INFO L87 Difference]: Start difference. First operand 783 states and 6028 transitions. Second operand 11 states. [2019-02-15 11:00:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:33,799 INFO L93 Difference]: Finished difference Result 956 states and 7015 transitions. [2019-02-15 11:00:33,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:00:33,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 11:00:33,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:33,806 INFO L225 Difference]: With dead ends: 956 [2019-02-15 11:00:33,806 INFO L226 Difference]: Without dead ends: 954 [2019-02-15 11:00:33,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:00:33,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-02-15 11:00:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 808. [2019-02-15 11:00:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-02-15 11:00:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 6214 transitions. [2019-02-15 11:00:34,105 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 6214 transitions. Word has length 6 [2019-02-15 11:00:34,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:34,105 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 6214 transitions. [2019-02-15 11:00:34,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:00:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 6214 transitions. [2019-02-15 11:00:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:34,107 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:34,107 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 11:00:34,107 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:34,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:34,107 INFO L82 PathProgramCache]: Analyzing trace with hash 904323940, now seen corresponding path program 2 times [2019-02-15 11:00:34,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:34,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:34,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:34,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:34,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:00:34,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:34,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:34,299 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:00:34,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:00:34,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:34,299 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:34,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:00:34,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:00:34,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:00:34,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:00:34,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:34,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 11:00:34,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 11:00:34,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 11:00:34,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 11:00:34,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 11:00:34,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:34,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 85 [2019-02-15 11:00:34,755 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:34,805 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:34,856 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:34,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:34,954 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:35,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:35,068 INFO L478 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 24 treesize of output 27 [2019-02-15 11:00:35,071 INFO L478 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 27 treesize of output 33 [2019-02-15 11:00:35,074 INFO L478 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 29 treesize of output 43 [2019-02-15 11:00:35,076 INFO L478 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 31 treesize of output 57 [2019-02-15 11:00:35,081 INFO L478 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 33 treesize of output 75 [2019-02-15 11:00:35,085 INFO L478 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 35 treesize of output 97 [2019-02-15 11:00:35,089 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 11:00:35,089 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:35,142 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:35,174 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:35,198 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:35,218 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:35,234 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:35,249 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:35,321 INFO L267 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-15 11:00:35,321 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-15 11:00:35,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,357 INFO L478 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-15 11:00:35,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:35,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:35,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-15 11:00:35,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,481 INFO L478 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 142 [2019-02-15 11:00:35,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:35,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:35,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:108, output treesize:78 [2019-02-15 11:00:35,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,598 INFO L478 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 48 treesize of output 152 [2019-02-15 11:00:35,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:35,679 INFO L267 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-15 11:00:35,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:88, output treesize:76 [2019-02-15 11:00:35,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:35,795 INFO L478 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 48 treesize of output 164 [2019-02-15 11:00:35,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:35,875 INFO L267 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-15 11:00:35,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-02-15 11:00:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:35,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:35,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:35,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:35,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 11:00:35,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:35,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:00:35,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:00:35,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:00:35,970 INFO L87 Difference]: Start difference. First operand 808 states and 6214 transitions. Second operand 11 states. [2019-02-15 11:00:37,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:37,305 INFO L93 Difference]: Finished difference Result 1087 states and 7943 transitions. [2019-02-15 11:00:37,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:00:37,306 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 11:00:37,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:37,311 INFO L225 Difference]: With dead ends: 1087 [2019-02-15 11:00:37,311 INFO L226 Difference]: Without dead ends: 1084 [2019-02-15 11:00:37,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:00:37,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2019-02-15 11:00:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 849. [2019-02-15 11:00:37,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-02-15 11:00:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 6541 transitions. [2019-02-15 11:00:37,615 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 6541 transitions. Word has length 6 [2019-02-15 11:00:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:37,615 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 6541 transitions. [2019-02-15 11:00:37,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:00:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 6541 transitions. [2019-02-15 11:00:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:37,616 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:37,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:37,617 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:37,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:37,617 INFO L82 PathProgramCache]: Analyzing trace with hash 904327972, now seen corresponding path program 1 times [2019-02-15 11:00:37,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:37,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:37,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:00:37,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:37,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:00:37,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:37,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:37,681 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:37,682 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [32], [33] [2019-02-15 11:00:37,682 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:37,682 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:37,684 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:37,684 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:00:37,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:37,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:37,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:37,685 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:37,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:37,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:37,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:37,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:00:37,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:00:37,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:00:37,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:00:37,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 11:00:37,960 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:37,987 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:38,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:38,038 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:38,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:38,102 INFO L478 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 24 treesize of output 27 [2019-02-15 11:00:38,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:00:38,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:00:38,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:00:38,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:00:38,116 INFO L478 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 35 treesize of output 97 [2019-02-15 11:00:38,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 11:00:38,124 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:38,162 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:38,191 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:38,214 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:38,233 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:38,247 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:38,261 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:38,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:38,310 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 11:00:38,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:00:38,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:38,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:38,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:00:38,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 11:00:38,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:38,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:38,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 11:00:38,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:38,540 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:38,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-02-15 11:00:38,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:38,593 INFO L267 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-15 11:00:38,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-15 11:00:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:38,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:38,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:38,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:38,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:00:38,731 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:38,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:00:38,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:00:38,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:00:38,732 INFO L87 Difference]: Start difference. First operand 849 states and 6541 transitions. Second operand 10 states. [2019-02-15 11:00:39,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:39,707 INFO L93 Difference]: Finished difference Result 942 states and 6912 transitions. [2019-02-15 11:00:39,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:00:39,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:00:39,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:39,712 INFO L225 Difference]: With dead ends: 942 [2019-02-15 11:00:39,712 INFO L226 Difference]: Without dead ends: 940 [2019-02-15 11:00:39,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:00:39,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-02-15 11:00:40,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 891. [2019-02-15 11:00:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-02-15 11:00:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 6849 transitions. [2019-02-15 11:00:40,035 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 6849 transitions. Word has length 6 [2019-02-15 11:00:40,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:40,035 INFO L480 AbstractCegarLoop]: Abstraction has 891 states and 6849 transitions. [2019-02-15 11:00:40,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:00:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 6849 transitions. [2019-02-15 11:00:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:40,037 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:40,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:40,037 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:40,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:40,037 INFO L82 PathProgramCache]: Analyzing trace with hash 904333738, now seen corresponding path program 1 times [2019-02-15 11:00:40,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:40,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:40,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:40,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:40,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:00:40,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:40,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:40,128 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:40,128 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [32], [33] [2019-02-15 11:00:40,129 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:40,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:40,131 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:40,131 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:00:40,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:40,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:40,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:40,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:40,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:40,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:40,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:40,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:00:40,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:00:40,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:00:40,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:00:40,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:00:40,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,226 INFO L478 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 35 treesize of output 97 [2019-02-15 11:00:40,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,237 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 11:00:40,238 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:40,298 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:40,332 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:40,358 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:40,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:40,394 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:40,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:40,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 11:00:40,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 11:00:40,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 11:00:40,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 11:00:40,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 11:00:40,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 85 [2019-02-15 11:00:40,794 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:40,833 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:40,871 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:40,911 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:40,951 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:40,992 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:41,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:41,059 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-15 11:00:41,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,095 INFO L478 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-15 11:00:41,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:41,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:41,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-15 11:00:41,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,201 INFO L478 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 142 [2019-02-15 11:00:41,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:41,272 INFO L267 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-15 11:00:41,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-15 11:00:41,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:41,315 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:41,316 INFO L478 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 158 [2019-02-15 11:00:41,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:41,393 INFO L267 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-15 11:00:41,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2019-02-15 11:00:41,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:41,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:41,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:41,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:41,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 11:00:41,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:41,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:00:41,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:00:41,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:00:41,471 INFO L87 Difference]: Start difference. First operand 891 states and 6849 transitions. Second operand 9 states. [2019-02-15 11:00:42,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:42,579 INFO L93 Difference]: Finished difference Result 959 states and 7083 transitions. [2019-02-15 11:00:42,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:00:42,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 11:00:42,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:42,584 INFO L225 Difference]: With dead ends: 959 [2019-02-15 11:00:42,584 INFO L226 Difference]: Without dead ends: 951 [2019-02-15 11:00:42,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:00:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-02-15 11:00:42,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 909. [2019-02-15 11:00:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-02-15 11:00:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 7020 transitions. [2019-02-15 11:00:42,939 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 7020 transitions. Word has length 6 [2019-02-15 11:00:42,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:42,939 INFO L480 AbstractCegarLoop]: Abstraction has 909 states and 7020 transitions. [2019-02-15 11:00:42,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:00:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 7020 transitions. [2019-02-15 11:00:42,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:42,941 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:42,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:42,941 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:42,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:42,941 INFO L82 PathProgramCache]: Analyzing trace with hash 904320284, now seen corresponding path program 1 times [2019-02-15 11:00:42,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:42,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:42,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:42,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:42,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:00:43,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:43,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:43,022 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:43,023 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [32], [33] [2019-02-15 11:00:43,023 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:43,023 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:43,025 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:43,025 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:00:43,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:43,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:43,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:43,026 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:43,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:43,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:43,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:43,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:00:43,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:00:43,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:00:43,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:00:43,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:00:43,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,101 INFO L478 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 35 treesize of output 97 [2019-02-15 11:00:43,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 11:00:43,115 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,155 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,188 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,213 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,234 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,250 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:00:43,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:00:43,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:00:43,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:00:43,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,715 INFO L303 Elim1Store]: Index analysis took 209 ms [2019-02-15 11:00:43,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 11:00:43,717 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,770 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,796 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,824 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,875 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:43,923 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 11:00:43,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:00:43,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:44,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:44,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:00:44,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 11:00:44,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:44,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:44,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 11:00:44,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:44,154 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:44,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 129 [2019-02-15 11:00:44,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:44,205 INFO L267 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-15 11:00:44,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-15 11:00:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:44,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:44,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:44,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 11:00:44,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:44,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:00:44,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:00:44,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:00:44,284 INFO L87 Difference]: Start difference. First operand 909 states and 7020 transitions. Second operand 9 states. [2019-02-15 11:00:45,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:45,235 INFO L93 Difference]: Finished difference Result 973 states and 7237 transitions. [2019-02-15 11:00:45,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:00:45,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 11:00:45,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:45,240 INFO L225 Difference]: With dead ends: 973 [2019-02-15 11:00:45,240 INFO L226 Difference]: Without dead ends: 972 [2019-02-15 11:00:45,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:00:45,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-02-15 11:00:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 929. [2019-02-15 11:00:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-02-15 11:00:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 7180 transitions. [2019-02-15 11:00:45,625 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 7180 transitions. Word has length 6 [2019-02-15 11:00:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:45,626 INFO L480 AbstractCegarLoop]: Abstraction has 929 states and 7180 transitions. [2019-02-15 11:00:45,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:00:45,626 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 7180 transitions. [2019-02-15 11:00:45,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:45,627 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:45,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:45,628 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:45,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:45,628 INFO L82 PathProgramCache]: Analyzing trace with hash 904792908, now seen corresponding path program 1 times [2019-02-15 11:00:45,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:45,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:45,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:45,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:45,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:45,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:45,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:45,699 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:45,699 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [26], [31] [2019-02-15 11:00:45,702 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:45,702 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:45,704 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:45,704 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:00:45,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:45,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:45,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:45,705 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:45,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:45,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:45,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:45,938 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 11:00:45,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:45,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:00:46,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:00:46,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:00:46,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:00:46,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:46,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 11:00:46,188 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:46,225 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:46,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:46,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:46,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:46,379 INFO L478 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 24 treesize of output 27 [2019-02-15 11:00:46,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:00:46,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:00:46,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:00:46,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:00:46,391 INFO L478 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 35 treesize of output 97 [2019-02-15 11:00:46,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 11:00:46,401 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:46,947 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:47,370 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:47,687 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:47,896 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:47,910 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:47,923 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:47,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:47,971 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:95, output treesize:96 [2019-02-15 11:00:48,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:00:48,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:48,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:48,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:00:48,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-02-15 11:00:48,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:48,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:48,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-15 11:00:48,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,232 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:48,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-02-15 11:00:48,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:48,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:48,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-02-15 11:00:48,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,329 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:48,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 120 [2019-02-15 11:00:48,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:48,409 INFO L267 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-15 11:00:48,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-02-15 11:00:48,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:48,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:48,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:48,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:00:48,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:48,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:00:48,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:00:48,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:00:48,594 INFO L87 Difference]: Start difference. First operand 929 states and 7180 transitions. Second operand 12 states. [2019-02-15 11:00:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:50,015 INFO L93 Difference]: Finished difference Result 1006 states and 7394 transitions. [2019-02-15 11:00:50,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:00:50,016 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:00:50,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:50,020 INFO L225 Difference]: With dead ends: 1006 [2019-02-15 11:00:50,020 INFO L226 Difference]: Without dead ends: 1004 [2019-02-15 11:00:50,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:00:50,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-02-15 11:00:50,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 890. [2019-02-15 11:00:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-02-15 11:00:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 6868 transitions. [2019-02-15 11:00:50,393 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 6868 transitions. Word has length 6 [2019-02-15 11:00:50,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:50,394 INFO L480 AbstractCegarLoop]: Abstraction has 890 states and 6868 transitions. [2019-02-15 11:00:50,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:00:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 6868 transitions. [2019-02-15 11:00:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:50,396 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:50,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:50,397 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:50,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:50,397 INFO L82 PathProgramCache]: Analyzing trace with hash 904808472, now seen corresponding path program 1 times [2019-02-15 11:00:50,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:50,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:50,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:50,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:50,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:50,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:50,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:50,500 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:50,500 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [26], [32], [33] [2019-02-15 11:00:50,501 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:50,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:50,503 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:50,503 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:00:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:50,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:50,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:50,504 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:50,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:50,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:50,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:50,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:00:50,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:00:50,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:00:50,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:00:50,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:50,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 11:00:50,819 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:50,855 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:50,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:50,931 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:50,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:51,017 INFO L478 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 24 treesize of output 27 [2019-02-15 11:00:51,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:00:51,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:00:51,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:00:51,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:00:51,033 INFO L478 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 35 treesize of output 97 [2019-02-15 11:00:51,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 11:00:51,044 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:51,081 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:51,111 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:51,134 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:51,152 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:51,167 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:51,181 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:51,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:51,229 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 11:00:51,338 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-02-15 11:00:51,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:00:51,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:51,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:51,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:00:51,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-02-15 11:00:51,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:51,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:51,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 11:00:51,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,512 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:51,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:51,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-02-15 11:00:51,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:51,562 INFO L267 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-15 11:00:51,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 11:00:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:51,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:51,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:51,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:51,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:00:51,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:51,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:00:51,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:00:51,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:00:51,642 INFO L87 Difference]: Start difference. First operand 890 states and 6868 transitions. Second operand 10 states. [2019-02-15 11:00:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:52,715 INFO L93 Difference]: Finished difference Result 959 states and 7078 transitions. [2019-02-15 11:00:52,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:00:52,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:00:52,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:52,720 INFO L225 Difference]: With dead ends: 959 [2019-02-15 11:00:52,720 INFO L226 Difference]: Without dead ends: 958 [2019-02-15 11:00:52,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:00:52,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2019-02-15 11:00:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 910. [2019-02-15 11:00:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-02-15 11:00:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 7028 transitions. [2019-02-15 11:00:53,123 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 7028 transitions. Word has length 6 [2019-02-15 11:00:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:53,123 INFO L480 AbstractCegarLoop]: Abstraction has 910 states and 7028 transitions. [2019-02-15 11:00:53,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:00:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 7028 transitions. [2019-02-15 11:00:53,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:53,125 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:53,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:53,125 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:53,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:53,125 INFO L82 PathProgramCache]: Analyzing trace with hash 904808346, now seen corresponding path program 1 times [2019-02-15 11:00:53,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:53,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:53,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:53,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:53,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:53,328 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 23 [2019-02-15 11:00:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:53,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:53,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:53,421 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:53,421 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [26], [28], [31] [2019-02-15 11:00:53,422 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:53,422 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:53,424 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:53,424 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:00:53,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:53,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:53,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:53,424 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:53,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:53,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:53,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:53,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:00:53,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:00:53,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:00:53,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:00:53,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 11:00:53,682 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,707 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,758 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,823 INFO L478 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 24 treesize of output 27 [2019-02-15 11:00:53,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:00:53,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:00:53,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:00:53,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:00:53,855 INFO L478 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 35 treesize of output 97 [2019-02-15 11:00:53,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 11:00:53,864 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,920 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,950 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,973 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,991 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:54,006 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:54,020 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:54,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:54,068 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:95, output treesize:96 [2019-02-15 11:00:54,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-15 11:00:54,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:00:54,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:00:54,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:106, output treesize:150 [2019-02-15 11:00:54,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 129 [2019-02-15 11:00:54,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:54,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 118 [2019-02-15 11:00:54,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-15 11:00:54,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2019-02-15 11:00:54,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:172, output treesize:177 [2019-02-15 11:00:54,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,792 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:54,802 INFO L478 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 2 case distinctions, treesize of input 72 treesize of output 153 [2019-02-15 11:00:54,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:00:55,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,141 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:55,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 124 [2019-02-15 11:00:55,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:55,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,316 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:55,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 130 [2019-02-15 11:00:55,318 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:55,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 17 dim-0 vars, and 4 xjuncts. [2019-02-15 11:00:55,463 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:207, output treesize:196 [2019-02-15 11:00:55,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,606 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 127 [2019-02-15 11:00:55,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:55,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,747 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:55,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 129 [2019-02-15 11:00:55,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:55,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,895 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:55,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:55,920 INFO L478 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 6 case distinctions, treesize of input 66 treesize of output 144 [2019-02-15 11:00:55,924 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2019-02-15 11:00:56,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-02-15 11:00:56,304 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:189, output treesize:310 [2019-02-15 11:00:56,574 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 133 [2019-02-15 11:00:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:56,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:56,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:56,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:00:56,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:56,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:00:56,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:00:56,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:00:56,685 INFO L87 Difference]: Start difference. First operand 910 states and 7028 transitions. Second operand 12 states. [2019-02-15 11:00:56,947 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-02-15 11:00:57,215 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2019-02-15 11:00:59,580 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2019-02-15 11:01:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:02,767 INFO L93 Difference]: Finished difference Result 1033 states and 7604 transitions. [2019-02-15 11:01:02,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:01:02,767 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:01:02,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:02,772 INFO L225 Difference]: With dead ends: 1033 [2019-02-15 11:01:02,772 INFO L226 Difference]: Without dead ends: 1032 [2019-02-15 11:01:02,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=125, Invalid=254, Unknown=1, NotChecked=0, Total=380 [2019-02-15 11:01:02,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2019-02-15 11:01:03,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 910. [2019-02-15 11:01:03,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-02-15 11:01:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 7028 transitions. [2019-02-15 11:01:03,159 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 7028 transitions. Word has length 6 [2019-02-15 11:01:03,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:03,159 INFO L480 AbstractCegarLoop]: Abstraction has 910 states and 7028 transitions. [2019-02-15 11:01:03,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:01:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 7028 transitions. [2019-02-15 11:01:03,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:01:03,161 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:03,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:01:03,161 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:03,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:03,162 INFO L82 PathProgramCache]: Analyzing trace with hash 904810394, now seen corresponding path program 1 times [2019-02-15 11:01:03,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:03,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:03,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:03,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:03,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:03,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:03,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:03,255 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:01:03,256 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [32], [33] [2019-02-15 11:01:03,256 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:03,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:03,258 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:03,258 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:01:03,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:03,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:03,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:03,259 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:01:03,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:03,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:03,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:03,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 11:01:03,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 11:01:03,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 11:01:03,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 11:01:03,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 11:01:03,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:03,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 85 [2019-02-15 11:01:03,666 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:03,708 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:03,751 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:03,794 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:03,838 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:03,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:03,932 INFO L478 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 24 treesize of output 27 [2019-02-15 11:01:03,935 INFO L478 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 27 treesize of output 33 [2019-02-15 11:01:03,937 INFO L478 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 29 treesize of output 43 [2019-02-15 11:01:03,940 INFO L478 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 31 treesize of output 57 [2019-02-15 11:01:03,944 INFO L478 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 33 treesize of output 75 [2019-02-15 11:01:03,947 INFO L478 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 35 treesize of output 97 [2019-02-15 11:01:03,950 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 11:01:03,951 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:04,032 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:04,062 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:04,086 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:04,104 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:04,120 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:04,135 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:04,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:04,204 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-15 11:01:04,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,238 INFO L478 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-15 11:01:04,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:04,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:04,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-15 11:01:04,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,342 INFO L478 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 134 [2019-02-15 11:01:04,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:04,412 INFO L267 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-15 11:01:04,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-15 11:01:04,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:04,476 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:04,477 INFO L478 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 152 [2019-02-15 11:01:04,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:04,548 INFO L267 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-15 11:01:04,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2019-02-15 11:01:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:04,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:04,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:04,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:04,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:01:04,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:04,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:01:04,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:01:04,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:01:04,632 INFO L87 Difference]: Start difference. First operand 910 states and 7028 transitions. Second operand 10 states. [2019-02-15 11:01:05,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:05,828 INFO L93 Difference]: Finished difference Result 975 states and 7194 transitions. [2019-02-15 11:01:05,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:01:05,828 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:01:05,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:05,833 INFO L225 Difference]: With dead ends: 975 [2019-02-15 11:01:05,833 INFO L226 Difference]: Without dead ends: 971 [2019-02-15 11:01:05,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:01:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-02-15 11:01:06,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 926. [2019-02-15 11:01:06,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-02-15 11:01:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 7136 transitions. [2019-02-15 11:01:06,245 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 7136 transitions. Word has length 6 [2019-02-15 11:01:06,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:06,245 INFO L480 AbstractCegarLoop]: Abstraction has 926 states and 7136 transitions. [2019-02-15 11:01:06,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:01:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 7136 transitions. [2019-02-15 11:01:06,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:01:06,247 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:06,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:01:06,247 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:06,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:06,247 INFO L82 PathProgramCache]: Analyzing trace with hash 904810206, now seen corresponding path program 2 times [2019-02-15 11:01:06,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:06,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:06,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:06,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:06,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:06,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:06,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:06,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:01:06,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:01:06,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:06,358 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:01:06,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:01:06,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:01:06,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:01:06,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:01:06,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:06,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:01:06,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:01:06,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:01:06,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:01:06,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,430 INFO L478 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 33 treesize of output 75 [2019-02-15 11:01:06,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,438 INFO L478 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 35 treesize of output 97 [2019-02-15 11:01:06,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,451 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 11:01:06,452 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:06,574 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:06,610 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:06,636 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:06,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:06,675 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:06,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:06,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 11:01:06,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 11:01:06,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 11:01:06,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 11:01:06,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:06,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 11:01:07,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 85 [2019-02-15 11:01:07,090 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:07,131 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:07,170 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:07,210 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:07,252 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:07,292 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:07,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:07,361 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:118, output treesize:120 [2019-02-15 11:01:07,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,413 INFO L478 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-15 11:01:07,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:07,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:07,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:130, output treesize:96 [2019-02-15 11:01:07,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,528 INFO L478 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 134 [2019-02-15 11:01:07,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:07,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:07,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:108, output treesize:78 [2019-02-15 11:01:07,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,650 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:07,651 INFO L478 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 152 [2019-02-15 11:01:07,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:07,722 INFO L267 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-15 11:01:07,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:88, output treesize:66 [2019-02-15 11:01:07,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,770 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:07,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:07,772 INFO L478 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 147 [2019-02-15 11:01:07,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:07,842 INFO L267 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-15 11:01:07,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:76, output treesize:56 [2019-02-15 11:01:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:07,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:07,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:07,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:01:07,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:07,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:01:07,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:01:07,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:01:07,955 INFO L87 Difference]: Start difference. First operand 926 states and 7136 transitions. Second operand 12 states. [2019-02-15 11:01:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:09,365 INFO L93 Difference]: Finished difference Result 1013 states and 7438 transitions. [2019-02-15 11:01:09,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:01:09,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:01:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:09,370 INFO L225 Difference]: With dead ends: 1013 [2019-02-15 11:01:09,370 INFO L226 Difference]: Without dead ends: 1011 [2019-02-15 11:01:09,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:01:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2019-02-15 11:01:09,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 937. [2019-02-15 11:01:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2019-02-15 11:01:09,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 7224 transitions. [2019-02-15 11:01:09,772 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 7224 transitions. Word has length 6 [2019-02-15 11:01:09,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:09,772 INFO L480 AbstractCegarLoop]: Abstraction has 937 states and 7224 transitions. [2019-02-15 11:01:09,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:01:09,772 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 7224 transitions. [2019-02-15 11:01:09,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:01:09,774 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:09,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:01:09,774 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:09,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:09,774 INFO L82 PathProgramCache]: Analyzing trace with hash 904796940, now seen corresponding path program 1 times [2019-02-15 11:01:09,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:09,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:09,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:01:09,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:09,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:09,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:09,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:09,846 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:01:09,846 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [32], [33] [2019-02-15 11:01:09,847 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:09,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:09,848 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:09,848 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:01:09,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:09,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:09,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:09,849 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:01:09,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:09,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:09,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:09,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:01:09,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:01:09,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:01:09,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:01:09,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,912 INFO L478 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 33 treesize of output 75 [2019-02-15 11:01:09,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,922 INFO L478 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 35 treesize of output 97 [2019-02-15 11:01:09,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 11:01:09,933 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:09,972 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:10,005 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:10,028 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:10,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:10,066 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:10,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:10,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:01:10,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:01:10,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:01:10,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:01:10,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 11:01:10,361 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:10,387 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:10,413 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:10,439 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:10,465 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:10,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:10,514 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 11:01:10,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:01:10,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:10,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:10,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:01:10,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-02-15 11:01:10,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:10,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:10,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 11:01:10,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,744 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:10,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-02-15 11:01:10,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:10,797 INFO L267 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-15 11:01:10,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-15 11:01:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:10,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:10,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:10,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:01:10,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:10,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:01:10,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:01:10,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:01:10,879 INFO L87 Difference]: Start difference. First operand 937 states and 7224 transitions. Second operand 10 states. [2019-02-15 11:01:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:11,828 INFO L93 Difference]: Finished difference Result 996 states and 7376 transitions. [2019-02-15 11:01:11,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:01:11,828 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:01:11,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:11,833 INFO L225 Difference]: With dead ends: 996 [2019-02-15 11:01:11,833 INFO L226 Difference]: Without dead ends: 995 [2019-02-15 11:01:11,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:01:11,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2019-02-15 11:01:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 949. [2019-02-15 11:01:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-02-15 11:01:12,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 7320 transitions. [2019-02-15 11:01:12,266 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 7320 transitions. Word has length 6 [2019-02-15 11:01:12,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:12,266 INFO L480 AbstractCegarLoop]: Abstraction has 949 states and 7320 transitions. [2019-02-15 11:01:12,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:01:12,266 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 7320 transitions. [2019-02-15 11:01:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:01:12,268 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:12,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:01:12,268 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:12,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:12,268 INFO L82 PathProgramCache]: Analyzing trace with hash 904796752, now seen corresponding path program 1 times [2019-02-15 11:01:12,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:12,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:12,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:12,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:12,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:12,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:12,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:12,388 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:01:12,388 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [26], [31] [2019-02-15 11:01:12,389 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:12,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:12,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:12,390 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:01:12,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:12,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:12,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:12,391 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:01:12,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:12,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:12,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:12,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:01:12,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:01:12,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:01:12,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:01:12,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,454 INFO L478 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 33 treesize of output 75 [2019-02-15 11:01:12,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,464 INFO L478 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 35 treesize of output 97 [2019-02-15 11:01:12,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 11:01:12,475 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:12,515 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:12,547 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:12,572 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:12,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:12,611 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:12,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:12,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:01:12,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:01:12,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:01:12,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:01:12,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:12,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 11:01:12,894 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:12,920 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:12,946 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:12,973 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,000 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:13,050 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:95, output treesize:96 [2019-02-15 11:01:13,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:01:13,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:13,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:01:13,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-02-15 11:01:13,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:13,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-15 11:01:13,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,320 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:13,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-02-15 11:01:13,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:13,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-15 11:01:13,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,415 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:13,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-02-15 11:01:13,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,469 INFO L267 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-15 11:01:13,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-02-15 11:01:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:13,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:13,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:13,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:01:13,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:13,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:01:13,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:01:13,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:01:13,577 INFO L87 Difference]: Start difference. First operand 949 states and 7320 transitions. Second operand 12 states. [2019-02-15 11:01:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:14,954 INFO L93 Difference]: Finished difference Result 1033 states and 7605 transitions. [2019-02-15 11:01:14,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:01:14,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:01:14,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:14,959 INFO L225 Difference]: With dead ends: 1033 [2019-02-15 11:01:14,959 INFO L226 Difference]: Without dead ends: 1031 [2019-02-15 11:01:14,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:01:14,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2019-02-15 11:01:15,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 975. [2019-02-15 11:01:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2019-02-15 11:01:15,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 7528 transitions. [2019-02-15 11:01:15,383 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 7528 transitions. Word has length 6 [2019-02-15 11:01:15,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:15,383 INFO L480 AbstractCegarLoop]: Abstraction has 975 states and 7528 transitions. [2019-02-15 11:01:15,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:01:15,384 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 7528 transitions. [2019-02-15 11:01:15,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:01:15,385 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:15,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:01:15,385 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:15,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:15,386 INFO L82 PathProgramCache]: Analyzing trace with hash 904456810, now seen corresponding path program 1 times [2019-02-15 11:01:15,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:15,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:15,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:15,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:15,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:01:15,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:15,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:15,444 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:01:15,444 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [32], [34], [35] [2019-02-15 11:01:15,444 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:15,445 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:15,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:15,446 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:01:15,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:15,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:15,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:15,447 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:01:15,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:15,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:15,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:15,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:01:15,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:01:15,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:01:15,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:01:15,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,510 INFO L478 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 33 treesize of output 75 [2019-02-15 11:01:15,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,518 INFO L478 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 35 treesize of output 97 [2019-02-15 11:01:15,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 11:01:15,529 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,571 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,605 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,630 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,666 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:01:15,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:01:15,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:01:15,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:01:15,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:15,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 11:01:15,937 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,964 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:15,989 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:16,015 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:16,042 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:16,090 INFO L267 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-15 11:01:16,090 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:01:16,231 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-02-15 11:01:16,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:16,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:01:16,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:16,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:16,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:01:16,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:16,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:16,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:16,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:16,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:16,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:16,309 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:16,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-02-15 11:01:16,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:16,359 INFO L267 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-15 11:01:16,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-02-15 11:01:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:16,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:16,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:16,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:01:16,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:16,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:01:16,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:01:16,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:01:16,424 INFO L87 Difference]: Start difference. First operand 975 states and 7528 transitions. Second operand 8 states. [2019-02-15 11:01:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:17,229 INFO L93 Difference]: Finished difference Result 1002 states and 7555 transitions. [2019-02-15 11:01:17,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:01:17,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:01:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:17,233 INFO L225 Difference]: With dead ends: 1002 [2019-02-15 11:01:17,233 INFO L226 Difference]: Without dead ends: 1001 [2019-02-15 11:01:17,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:01:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2019-02-15 11:01:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 975. [2019-02-15 11:01:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2019-02-15 11:01:17,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 7528 transitions. [2019-02-15 11:01:17,653 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 7528 transitions. Word has length 6 [2019-02-15 11:01:17,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:17,653 INFO L480 AbstractCegarLoop]: Abstraction has 975 states and 7528 transitions. [2019-02-15 11:01:17,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:01:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 7528 transitions. [2019-02-15 11:01:17,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:01:17,655 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:17,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:01:17,655 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:17,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:17,655 INFO L82 PathProgramCache]: Analyzing trace with hash 904431572, now seen corresponding path program 1 times [2019-02-15 11:01:17,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:17,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:17,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:17,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:17,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:17,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:17,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:17,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:17,785 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:01:17,785 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [26], [31] [2019-02-15 11:01:17,786 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:17,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:17,788 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:17,788 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:01:17,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:17,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:17,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:17,789 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:01:17,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:17,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:17,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:17,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:01:17,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:01:17,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:17,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:17,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:01:17,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:17,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:17,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:17,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:01:17,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:17,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:17,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:17,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:17,850 INFO L478 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 33 treesize of output 75 [2019-02-15 11:01:17,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:17,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:17,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:17,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:17,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:17,860 INFO L478 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 35 treesize of output 97 [2019-02-15 11:01:17,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 11:01:17,872 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:17,912 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:17,945 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:17,971 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:17,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,008 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:01:18,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:01:18,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:01:18,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:01:18,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 11:01:18,276 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,303 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,329 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,356 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,386 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:18,440 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 11:01:18,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:01:18,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:18,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:01:18,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,630 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:18,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-02-15 11:01:18,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:18,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-02-15 11:01:18,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-02-15 11:01:18,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:18,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:51 [2019-02-15 11:01:18,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,803 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:18,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-02-15 11:01:18,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,857 INFO L267 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-15 11:01:18,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-02-15 11:01:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:18,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:18,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:18,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2019-02-15 11:01:18,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:18,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:01:18,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:01:18,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:01:18,937 INFO L87 Difference]: Start difference. First operand 975 states and 7528 transitions. Second operand 12 states. [2019-02-15 11:01:20,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:20,268 INFO L93 Difference]: Finished difference Result 1224 states and 9054 transitions. [2019-02-15 11:01:20,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:01:20,268 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:01:20,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:20,274 INFO L225 Difference]: With dead ends: 1224 [2019-02-15 11:01:20,274 INFO L226 Difference]: Without dead ends: 1222 [2019-02-15 11:01:20,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:01:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-02-15 11:01:20,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1073. [2019-02-15 11:01:20,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2019-02-15 11:01:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 8311 transitions. [2019-02-15 11:01:20,755 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 8311 transitions. Word has length 6 [2019-02-15 11:01:20,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:20,755 INFO L480 AbstractCegarLoop]: Abstraction has 1073 states and 8311 transitions. [2019-02-15 11:01:20,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:01:20,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 8311 transitions. [2019-02-15 11:01:20,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:01:20,757 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:20,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:01:20,758 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:20,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:20,758 INFO L82 PathProgramCache]: Analyzing trace with hash 904447136, now seen corresponding path program 1 times [2019-02-15 11:01:20,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:20,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:20,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:20,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:20,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:21,067 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-02-15 11:01:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:21,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:21,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:21,164 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:01:21,164 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [32], [33] [2019-02-15 11:01:21,165 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:21,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:21,167 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:21,167 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:01:21,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:21,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:21,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:21,167 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:01:21,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:21,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:21,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:21,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:01:21,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:01:21,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:01:21,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:01:21,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,230 INFO L478 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 33 treesize of output 75 [2019-02-15 11:01:21,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,241 INFO L478 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 35 treesize of output 97 [2019-02-15 11:01:21,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 11:01:21,255 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:21,298 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:21,330 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:21,357 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:21,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:21,395 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:21,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:21,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:01:21,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:01:21,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:01:21,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:01:21,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 11:01:21,668 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:21,695 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:21,722 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:21,749 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:21,776 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:21,826 INFO L267 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-15 11:01:21,827 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:01:21,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:01:21,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:21,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:21,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:01:21,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:21,960 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:21,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-02-15 11:01:21,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:22,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:22,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-02-15 11:01:22,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:22,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:22,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:22,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:22,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:22,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:22,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:22,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:22,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:22,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:22,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:22,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 107 [2019-02-15 11:01:22,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:22,099 INFO L267 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-15 11:01:22,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-02-15 11:01:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:22,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:22,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:22,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-15 11:01:22,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:22,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:01:22,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:01:22,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:01:22,188 INFO L87 Difference]: Start difference. First operand 1073 states and 8311 transitions. Second operand 11 states. [2019-02-15 11:01:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:24,240 INFO L93 Difference]: Finished difference Result 1388 states and 10131 transitions. [2019-02-15 11:01:24,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-15 11:01:24,241 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 11:01:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:24,246 INFO L225 Difference]: With dead ends: 1388 [2019-02-15 11:01:24,246 INFO L226 Difference]: Without dead ends: 1386 [2019-02-15 11:01:24,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:01:24,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2019-02-15 11:01:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1170. [2019-02-15 11:01:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170 states. [2019-02-15 11:01:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 9078 transitions. [2019-02-15 11:01:24,757 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 9078 transitions. Word has length 6 [2019-02-15 11:01:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:24,757 INFO L480 AbstractCegarLoop]: Abstraction has 1170 states and 9078 transitions. [2019-02-15 11:01:24,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:01:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 9078 transitions. [2019-02-15 11:01:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:01:24,759 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:24,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:01:24,759 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:24,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:24,760 INFO L82 PathProgramCache]: Analyzing trace with hash 904933466, now seen corresponding path program 1 times [2019-02-15 11:01:24,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:24,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:24,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:24,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:24,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:24,939 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-02-15 11:01:24,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:24,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:24,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:24,950 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:01:24,950 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [32], [34], [35] [2019-02-15 11:01:24,951 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:24,951 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:24,953 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:24,953 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:01:24,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:24,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:24,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:24,954 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:01:24,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:24,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:24,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:24,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:24,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 63 [2019-02-15 11:01:24,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2019-02-15 11:01:25,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:25,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:25,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:25,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2019-02-15 11:01:25,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:25,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:25,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:25,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:25,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:25,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:25,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 72 [2019-02-15 11:01:25,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:25,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:25,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:25,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:25,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:25,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:25,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:25,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:25,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2019-02-15 11:01:25,159 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:25,194 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:25,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:25,263 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:25,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:25,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:01:25,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 33 [2019-02-15 11:01:25,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-15 11:01:25,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2019-02-15 11:01:25,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:01:25,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-02-15 11:01:25,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 88 [2019-02-15 11:01:25,380 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:25,414 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:25,441 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:25,461 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:25,477 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:25,493 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:25,507 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:25,552 INFO L267 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-15 11:01:25,552 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:84, output treesize:88 [2019-02-15 11:01:27,600 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-02-15 11:01:27,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 83 [2019-02-15 11:01:27,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:27,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:27,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:93, output treesize:63 [2019-02-15 11:01:27,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,678 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:27,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 98 [2019-02-15 11:01:27,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:27,723 INFO L267 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-15 11:01:27,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:75, output treesize:51 [2019-02-15 11:01:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:27,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:27,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:27,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:01:27,786 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:27,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:01:27,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:01:27,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:01:27,787 INFO L87 Difference]: Start difference. First operand 1170 states and 9078 transitions. Second operand 8 states. [2019-02-15 11:01:28,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:28,589 INFO L93 Difference]: Finished difference Result 1195 states and 9103 transitions. [2019-02-15 11:01:28,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:01:28,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:01:28,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:28,595 INFO L225 Difference]: With dead ends: 1195 [2019-02-15 11:01:28,595 INFO L226 Difference]: Without dead ends: 1194 [2019-02-15 11:01:28,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:01:28,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-02-15 11:01:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1170. [2019-02-15 11:01:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170 states. [2019-02-15 11:01:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 9078 transitions. [2019-02-15 11:01:29,086 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 9078 transitions. Word has length 6 [2019-02-15 11:01:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:29,087 INFO L480 AbstractCegarLoop]: Abstraction has 1170 states and 9078 transitions. [2019-02-15 11:01:29,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:01:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 9078 transitions. [2019-02-15 11:01:29,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:01:29,090 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:29,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:01:29,090 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:29,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:29,091 INFO L82 PathProgramCache]: Analyzing trace with hash 904929558, now seen corresponding path program 1 times [2019-02-15 11:01:29,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:29,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:29,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:29,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:29,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:29,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:29,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:29,190 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:01:29,190 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [28], [32], [33] [2019-02-15 11:01:29,193 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:29,193 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:29,195 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:29,195 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:01:29,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:29,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:29,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:29,196 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:01:29,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:29,206 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:29,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:29,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:01:29,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:01:29,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:01:29,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:01:29,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,261 INFO L478 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 33 treesize of output 75 [2019-02-15 11:01:29,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,271 INFO L478 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 35 treesize of output 97 [2019-02-15 11:01:29,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,283 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 11:01:29,284 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,367 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,401 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,427 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,445 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,463 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 11:01:29,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 11:01:29,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 11:01:29,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 11:01:29,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 11:01:29,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 85 [2019-02-15 11:01:29,882 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,922 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,962 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:30,002 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:30,044 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:30,086 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:30,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:30,155 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-15 11:01:30,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,195 INFO L478 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-15 11:01:30,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:30,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:30,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-15 11:01:30,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,300 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:30,301 INFO L478 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 135 [2019-02-15 11:01:30,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:30,371 INFO L267 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-15 11:01:30,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:80 [2019-02-15 11:01:30,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:30,414 INFO L478 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 50 treesize of output 144 [2019-02-15 11:01:30,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:30,484 INFO L267 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-15 11:01:30,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:94, output treesize:68 [2019-02-15 11:01:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:30,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:30,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:30,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:01:30,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:30,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:01:30,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:01:30,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:01:30,967 INFO L87 Difference]: Start difference. First operand 1170 states and 9078 transitions. Second operand 10 states. [2019-02-15 11:01:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:32,081 INFO L93 Difference]: Finished difference Result 1234 states and 9256 transitions. [2019-02-15 11:01:32,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:01:32,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:01:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:32,087 INFO L225 Difference]: With dead ends: 1234 [2019-02-15 11:01:32,088 INFO L226 Difference]: Without dead ends: 1231 [2019-02-15 11:01:32,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:01:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2019-02-15 11:01:32,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1189. [2019-02-15 11:01:32,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1189 states. [2019-02-15 11:01:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 9209 transitions. [2019-02-15 11:01:32,605 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 9209 transitions. Word has length 6 [2019-02-15 11:01:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:32,605 INFO L480 AbstractCegarLoop]: Abstraction has 1189 states and 9209 transitions. [2019-02-15 11:01:32,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:01:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 9209 transitions. [2019-02-15 11:01:32,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:01:32,608 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:32,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:01:32,608 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:32,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:32,608 INFO L82 PathProgramCache]: Analyzing trace with hash 904928874, now seen corresponding path program 1 times [2019-02-15 11:01:32,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:32,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:32,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:32,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:32,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:32,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:32,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:32,682 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:01:32,682 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [26], [28], [31] [2019-02-15 11:01:32,683 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:32,683 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:32,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:32,685 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:01:32,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:32,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:32,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:32,686 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:01:32,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:32,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:32,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:32,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:01:32,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:01:32,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:01:32,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:01:32,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:32,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 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-15 11:01:32,980 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:33,008 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:33,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:33,065 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:33,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:33,132 INFO L478 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 24 treesize of output 27 [2019-02-15 11:01:33,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:01:33,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:01:33,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:01:33,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:01:33,146 INFO L478 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 35 treesize of output 97 [2019-02-15 11:01:33,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-15 11:01:33,156 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:33,194 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:33,225 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:33,246 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:33,265 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:33,280 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:33,295 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:33,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:33,345 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:95, output treesize:96 [2019-02-15 11:01:33,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:33,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-15 11:01:33,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:01:33,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:01:33,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:106, output treesize:150 [2019-02-15 11:01:33,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:33,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:33,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:33,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:33,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:33,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:33,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:33,667 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:33,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 119 [2019-02-15 11:01:33,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:01:33,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:33,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:33,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:33,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:33,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:33,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:33,893 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:33,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 126 [2019-02-15 11:01:33,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:34,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2019-02-15 11:01:34,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:172, output treesize:185 [2019-02-15 11:01:34,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,198 INFO L478 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 8 case distinctions, treesize of input 78 treesize of output 148 [2019-02-15 11:01:34,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 11:01:34,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:34,706 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:34,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 107 [2019-02-15 11:01:34,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:34,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-02-15 11:01:34,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:152, output treesize:346 [2019-02-15 11:01:35,140 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 129 [2019-02-15 11:01:35,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,162 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:35,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 129 [2019-02-15 11:01:35,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:35,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,374 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:35,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 126 [2019-02-15 11:01:35,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:35,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,551 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:35,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 120 [2019-02-15 11:01:35,553 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:35,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:35,738 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:35,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 138 [2019-02-15 11:01:35,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:35,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 4 dim-1 vars, End of recursive call: 20 dim-0 vars, and 4 xjuncts. [2019-02-15 11:01:35,887 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 24 variables, input treesize:267, output treesize:225 [2019-02-15 11:01:36,058 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 107 [2019-02-15 11:01:36,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:36,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:36,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:36,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:36,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:01:36,175 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:36,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:01:36,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:01:36,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:01:36,176 INFO L87 Difference]: Start difference. First operand 1189 states and 9209 transitions. Second operand 12 states. [2019-02-15 11:01:36,429 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-02-15 11:01:36,669 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 115 [2019-02-15 11:01:36,932 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 92 [2019-02-15 11:01:37,077 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2019-02-15 11:01:38,386 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-15 11:01:38,388 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-15 11:01:38,391 INFO L168 Benchmark]: Toolchain (without parser) took 238464.15 ms. Allocated memory was 139.5 MB in the beginning and 858.8 MB in the end (delta: 719.3 MB). Free memory was 106.9 MB in the beginning and 207.0 MB in the end (delta: -100.1 MB). Peak memory consumption was 619.2 MB. Max. memory is 7.1 GB. [2019-02-15 11:01:38,392 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 139.5 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 11:01:38,392 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.40 ms. Allocated memory is still 139.5 MB. Free memory was 106.5 MB in the beginning and 104.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-15 11:01:38,393 INFO L168 Benchmark]: Boogie Preprocessor took 43.54 ms. Allocated memory is still 139.5 MB. Free memory was 104.3 MB in the beginning and 103.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-15 11:01:38,393 INFO L168 Benchmark]: RCFGBuilder took 500.72 ms. Allocated memory is still 139.5 MB. Free memory was 103.0 MB in the beginning and 90.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2019-02-15 11:01:38,393 INFO L168 Benchmark]: TraceAbstraction took 237857.42 ms. Allocated memory was 139.5 MB in the beginning and 858.8 MB in the end (delta: 719.3 MB). Free memory was 90.5 MB in the beginning and 207.0 MB in the end (delta: -116.5 MB). Peak memory consumption was 602.8 MB. Max. memory is 7.1 GB. [2019-02-15 11:01:38,395 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.17 ms. Allocated memory is still 139.5 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.40 ms. Allocated memory is still 139.5 MB. Free memory was 106.5 MB in the beginning and 104.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.54 ms. Allocated memory is still 139.5 MB. Free memory was 104.3 MB in the beginning and 103.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 500.72 ms. Allocated memory is still 139.5 MB. Free memory was 103.0 MB in the beginning and 90.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237857.42 ms. Allocated memory was 139.5 MB in the beginning and 858.8 MB in the end (delta: 719.3 MB). Free memory was 90.5 MB in the beginning and 207.0 MB in the end (delta: -116.5 MB). Peak memory consumption was 602.8 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...