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-6-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-07 21:41:32,644 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 21:41:32,646 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 21:41:32,666 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 21:41:32,666 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 21:41:32,667 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 21:41:32,669 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 21:41:32,671 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 21:41:32,673 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 21:41:32,674 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 21:41:32,675 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 21:41:32,675 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 21:41:32,676 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 21:41:32,677 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 21:41:32,679 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 21:41:32,679 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 21:41:32,682 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 21:41:32,690 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 21:41:32,698 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 21:41:32,700 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 21:41:32,702 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 21:41:32,703 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 21:41:32,705 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 21:41:32,706 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 21:41:32,706 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 21:41:32,706 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 21:41:32,707 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 21:41:32,708 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 21:41:32,709 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 21:41:32,710 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 21:41:32,710 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 21:41:32,711 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 21:41:32,711 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 21:41:32,711 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 21:41:32,712 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 21:41:32,713 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 21:41:32,713 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-01-07 21:41:32,727 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 21:41:32,727 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 21:41:32,728 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 21:41:32,728 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 21:41:32,731 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 21:41:32,731 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 21:41:32,731 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 21:41:32,731 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 21:41:32,732 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 21:41:32,732 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 21:41:32,732 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 21:41:32,732 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 21:41:32,732 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 21:41:32,733 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 21:41:32,733 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 21:41:32,733 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 21:41:32,734 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 21:41:32,735 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 21:41:32,735 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 21:41:32,735 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 21:41:32,735 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 21:41:32,736 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 21:41:32,736 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 21:41:32,736 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 21:41:32,736 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 21:41:32,736 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 21:41:32,736 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 21:41:32,739 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 21:41:32,739 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 21:41:32,739 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 21:41:32,739 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 21:41:32,739 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:41:32,740 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 21:41:32,740 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 21:41:32,740 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 21:41:32,740 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 21:41:32,740 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 21:41:32,741 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 21:41:32,741 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 21:41:32,741 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 21:41:32,782 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 21:41:32,799 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 21:41:32,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 21:41:32,809 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 21:41:32,809 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 21:41:32,810 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl [2019-01-07 21:41:32,810 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl' [2019-01-07 21:41:32,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 21:41:32,850 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 21:41:32,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 21:41:32,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 21:41:32,851 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 21:41:32,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:32" (1/1) ... [2019-01-07 21:41:32,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:32" (1/1) ... [2019-01-07 21:41:32,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 21:41:32,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 21:41:32,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 21:41:32,910 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 21:41:32,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:32" (1/1) ... [2019-01-07 21:41:32,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:32" (1/1) ... [2019-01-07 21:41:32,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:32" (1/1) ... [2019-01-07 21:41:32,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:32" (1/1) ... [2019-01-07 21:41:32,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:32" (1/1) ... [2019-01-07 21:41:32,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:32" (1/1) ... [2019-01-07 21:41:32,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:32" (1/1) ... [2019-01-07 21:41:32,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 21:41:32,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 21:41:32,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 21:41:32,937 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 21:41:32,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:41:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 21:41:33,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 21:41:33,515 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 21:41:33,515 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-07 21:41:33,517 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:41:33 BoogieIcfgContainer [2019-01-07 21:41:33,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 21:41:33,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 21:41:33,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 21:41:33,533 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 21:41:33,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:32" (1/2) ... [2019-01-07 21:41:33,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789fda22 and model type speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 09:41:33, skipping insertion in model container [2019-01-07 21:41:33,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:41:33" (2/2) ... [2019-01-07 21:41:33,544 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-unlimited.bpl [2019-01-07 21:41:33,572 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 21:41:33,594 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-07 21:41:33,630 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-07 21:41:33,668 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 21:41:33,668 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 21:41:33,668 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 21:41:33,668 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 21:41:33,668 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 21:41:33,669 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 21:41:33,669 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 21:41:33,669 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 21:41:33,687 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-07 21:41:33,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-07 21:41:33,694 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:33,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-07 21:41:33,698 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:33,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:33,706 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-01-07 21:41:33,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:33,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:33,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:33,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:33,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:33,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:41:33,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 21:41:33,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:41:33,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:41:33,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:41:33,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:41:33,993 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-01-07 21:41:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:34,212 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-01-07 21:41:34,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:41:34,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 21:41:34,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:34,230 INFO L225 Difference]: With dead ends: 29 [2019-01-07 21:41:34,230 INFO L226 Difference]: Without dead ends: 24 [2019-01-07 21:41:34,233 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-01-07 21:41:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-07 21:41:34,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-01-07 21:41:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-07 21:41:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-01-07 21:41:34,266 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-01-07 21:41:34,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:34,267 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-01-07 21:41:34,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:41:34,268 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-01-07 21:41:34,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:41:34,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:34,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:41:34,269 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:34,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:34,269 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-01-07 21:41:34,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:34,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:34,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:34,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:34,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:34,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:34,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:34,394 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:41:34,396 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-01-07 21:41:34,443 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:34,443 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:34,525 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:34,527 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 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-01-07 21:41:34,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:34,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:34,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:34,534 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-01-07 21:41:34,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:34,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:34,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:34,810 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-07 21:41:34,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:34,838 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 48 treesize of output 54 [2019-01-07 21:41:35,009 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-07 21:41:35,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:35,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:35,022 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 41 treesize of output 53 [2019-01-07 21:41:35,303 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-07 21:41:35,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:35,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:35,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:35,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:35,420 INFO L303 Elim1Store]: Index analysis took 113 ms [2019-01-07 21:41:35,422 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 32 treesize of output 61 [2019-01-07 21:41:35,648 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-01-07 21:41:35,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:35,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:35,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:35,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:35,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:35,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:35,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:41:35,712 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:35,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:35,778 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:35,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:35,873 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 21 treesize of output 24 [2019-01-07 21:41:35,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:41:35,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:41:35,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:41:35,928 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 30 treesize of output 72 [2019-01-07 21:41:36,050 INFO L303 Elim1Store]: Index analysis took 117 ms [2019-01-07 21:41:36,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:41:36,057 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:36,309 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:36,380 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:36,412 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:36,428 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:36,444 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:36,487 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-01-07 21:41:36,488 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-07 21:41:36,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:36,563 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:41:36,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:36,599 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-01-07 21:41:36,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-07 21:41:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:36,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:36,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:36,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:41:36,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:36,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:41:36,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:41:36,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:41:36,731 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-01-07 21:41:37,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:37,188 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-01-07 21:41:37,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:41:37,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 21:41:37,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:37,191 INFO L225 Difference]: With dead ends: 47 [2019-01-07 21:41:37,191 INFO L226 Difference]: Without dead ends: 45 [2019-01-07 21:41:37,261 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-01-07 21:41:37,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-07 21:41:37,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-01-07 21:41:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-07 21:41:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-01-07 21:41:37,274 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-01-07 21:41:37,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:37,274 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-01-07 21:41:37,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:41:37,274 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-01-07 21:41:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:41:37,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:37,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:41:37,276 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:37,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:37,277 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-01-07 21:41:37,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:37,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:37,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:37,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:37,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:37,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:37,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:37,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:37,351 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:41:37,351 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-01-07 21:41:37,354 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:37,355 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:37,364 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:37,364 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 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-01-07 21:41:37,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:37,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:37,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:37,365 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-01-07 21:41:37,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:37,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:37,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:37,460 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 21 treesize of output 24 [2019-01-07 21:41:37,474 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 24 treesize of output 30 [2019-01-07 21:41:37,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,500 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 26 treesize of output 40 [2019-01-07 21:41:37,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,524 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 28 treesize of output 54 [2019-01-07 21:41:37,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:41:37,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:41:37,568 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,635 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,663 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,679 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,697 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,885 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 48 treesize of output 54 [2019-01-07 21:41:37,987 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-07 21:41:38,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,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 41 treesize of output 53 [2019-01-07 21:41:38,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,057 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 32 treesize of output 61 [2019-01-07 21:41:38,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:41:38,113 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,138 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,162 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,180 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,220 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-01-07 21:41:38,221 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:72, output treesize:71 [2019-01-07 21:41:38,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,326 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:41:38,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,360 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-01-07 21:41:38,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-07 21:41:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:38,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:38,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:38,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 21:41:38,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-07 21:41:38,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:41:38,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:41:38,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:41:38,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-07 21:41:38,454 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-01-07 21:41:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:38,539 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-01-07 21:41:38,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 21:41:38,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 21:41:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:38,540 INFO L225 Difference]: With dead ends: 23 [2019-01-07 21:41:38,541 INFO L226 Difference]: Without dead ends: 22 [2019-01-07 21:41:38,541 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-01-07 21:41:38,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-07 21:41:38,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-07 21:41:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-07 21:41:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-01-07 21:41:38,548 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-01-07 21:41:38,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:38,548 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-01-07 21:41:38,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:41:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-01-07 21:41:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:41:38,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:38,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:41:38,550 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:38,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:38,550 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-01-07 21:41:38,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:38,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:38,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:38,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:38,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:38,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:38,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:38,698 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:41:38,698 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-01-07 21:41:38,701 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:38,701 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:38,709 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:38,709 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 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-01-07 21:41:38,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:38,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:38,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:38,710 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-01-07 21:41:38,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:38,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:38,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:38,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,781 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-01-07 21:41:38,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,829 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-01-07 21:41:38,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,970 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-01-07 21:41:39,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:39,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:39,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:39,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:39,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:39,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:39,035 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-01-07 21:41:39,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:39,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:39,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:39,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:39,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:39,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:39,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:39,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:39,112 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-01-07 21:41:39,113 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:39,141 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:39,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:39,199 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:39,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:39,342 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 21 treesize of output 24 [2019-01-07 21:41:39,346 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 24 treesize of output 30 [2019-01-07 21:41:39,353 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 26 treesize of output 40 [2019-01-07 21:41:39,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, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:41:39,381 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 30 treesize of output 72 [2019-01-07 21:41:39,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:41:39,394 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:39,451 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:39,476 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:39,496 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:39,655 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:39,668 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:39,731 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-01-07 21:41:39,732 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-01-07 21:41:39,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:39,765 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-01-07 21:41:39,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:39,820 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-01-07 21:41:39,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-01-07 21:41:39,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:39,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:40,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:40,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:41:40,103 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:40,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:41:40,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:41:40,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:41:40,104 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-01-07 21:41:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:40,301 INFO L93 Difference]: Finished difference Result 39 states and 79 transitions. [2019-01-07 21:41:40,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 21:41:40,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 21:41:40,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:40,303 INFO L225 Difference]: With dead ends: 39 [2019-01-07 21:41:40,303 INFO L226 Difference]: Without dead ends: 36 [2019-01-07 21:41:40,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:41:40,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-07 21:41:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2019-01-07 21:41:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-07 21:41:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 67 transitions. [2019-01-07 21:41:40,312 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 67 transitions. Word has length 3 [2019-01-07 21:41:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:40,312 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 67 transitions. [2019-01-07 21:41:40,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:41:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 67 transitions. [2019-01-07 21:41:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:41:40,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:40,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:41:40,314 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:40,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-01-07 21:41:40,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:40,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:40,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:40,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:40,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:40,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:40,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:40,420 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:41:40,420 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-01-07 21:41:40,423 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:40,423 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:40,429 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:40,429 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 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-01-07 21:41:40,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:40,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:40,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:40,430 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-01-07 21:41:40,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:40,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:40,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:40,478 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 21 treesize of output 24 [2019-01-07 21:41:40,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 30 [2019-01-07 21:41:40,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,492 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 26 treesize of output 40 [2019-01-07 21:41:40,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,506 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 28 treesize of output 54 [2019-01-07 21:41:40,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:41:40,666 INFO L303 Elim1Store]: Index analysis took 127 ms [2019-01-07 21:41:40,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:41:40,668 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:40,809 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:40,833 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:40,851 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:40,868 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:40,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:40,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,917 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 48 treesize of output 54 [2019-01-07 21:41:40,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,953 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 41 treesize of output 53 [2019-01-07 21:41:41,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,008 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 32 treesize of output 61 [2019-01-07 21:41:41,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:41:41,068 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,087 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,121 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,142 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,193 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-01-07 21:41:41,194 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-07 21:41:41,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:41:41,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,302 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-01-07 21:41:41,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-07 21:41:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:41,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:41,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:41,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:41:41,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:41,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:41:41,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:41:41,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:41:41,377 INFO L87 Difference]: Start difference. First operand 23 states and 67 transitions. Second operand 6 states. [2019-01-07 21:41:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:41,607 INFO L93 Difference]: Finished difference Result 49 states and 101 transitions. [2019-01-07 21:41:41,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:41:41,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 21:41:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:41,609 INFO L225 Difference]: With dead ends: 49 [2019-01-07 21:41:41,609 INFO L226 Difference]: Without dead ends: 47 [2019-01-07 21:41:41,609 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-01-07 21:41:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-07 21:41:41,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 25. [2019-01-07 21:41:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-07 21:41:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 80 transitions. [2019-01-07 21:41:41,617 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 80 transitions. Word has length 3 [2019-01-07 21:41:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:41,617 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 80 transitions. [2019-01-07 21:41:41,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:41:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 80 transitions. [2019-01-07 21:41:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:41,618 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:41,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:41,619 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:41,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:41,619 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-01-07 21:41:41,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:41,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:41,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:41,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:41,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:41,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:41,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:41,685 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:41,685 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-01-07 21:41:41,687 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:41,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:41,693 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:41,693 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-01-07 21:41:41,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:41,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:41,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:41,694 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-01-07 21:41:41,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:41,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:41,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:41,747 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 21 treesize of output 24 [2019-01-07 21:41:41,752 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 24 treesize of output 30 [2019-01-07 21:41:41,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,762 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 26 treesize of output 40 [2019-01-07 21:41:41,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,770 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 28 treesize of output 54 [2019-01-07 21:41:41,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,801 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 30 treesize of output 72 [2019-01-07 21:41:41,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:41:41,823 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,867 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,892 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,929 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,982 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 48 treesize of output 54 [2019-01-07 21:41:42,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-07 21:41:42,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-07 21:41:42,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:41:42,125 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:42,143 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:42,161 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:42,180 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:42,217 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-01-07 21:41:42,218 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-07 21:41:42,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,262 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:41:42,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:42,291 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-01-07 21:41:42,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-07 21:41:42,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,390 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-07 21:41:42,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:42,425 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-01-07 21:41:42,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-07 21:41:42,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-01-07 21:41:42,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:42,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:42,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:41:42,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:42,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:41:42,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:41:42,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:41:42,490 INFO L87 Difference]: Start difference. First operand 25 states and 80 transitions. Second operand 8 states. [2019-01-07 21:41:43,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:43,162 INFO L93 Difference]: Finished difference Result 61 states and 138 transitions. [2019-01-07 21:41:43,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:41:43,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:41:43,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:43,165 INFO L225 Difference]: With dead ends: 61 [2019-01-07 21:41:43,165 INFO L226 Difference]: Without dead ends: 57 [2019-01-07 21:41:43,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:41:43,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-07 21:41:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-01-07 21:41:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-07 21:41:43,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 98 transitions. [2019-01-07 21:41:43,175 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 98 transitions. Word has length 4 [2019-01-07 21:41:43,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:43,175 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 98 transitions. [2019-01-07 21:41:43,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:41:43,175 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 98 transitions. [2019-01-07 21:41:43,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:43,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:43,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:43,177 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:43,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:43,177 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-01-07 21:41:43,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:43,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:43,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:43,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:43,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:43,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:43,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:43,281 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:43,281 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-01-07 21:41:43,282 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:43,283 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:43,288 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:43,289 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-01-07 21:41:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:43,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:43,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:43,289 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-01-07 21:41:43,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:43,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:43,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:43,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,341 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-01-07 21:41:43,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,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-01-07 21:41:43,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,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 46 treesize of output 72 [2019-01-07 21:41:43,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,537 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-01-07 21:41:43,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,605 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-01-07 21:41:43,606 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,632 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,682 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,750 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 21 treesize of output 24 [2019-01-07 21:41:43,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, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:41:43,762 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 26 treesize of output 40 [2019-01-07 21:41:43,768 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 28 treesize of output 54 [2019-01-07 21:41:43,774 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 30 treesize of output 72 [2019-01-07 21:41:43,778 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:41:43,778 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,818 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,836 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,850 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,863 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,874 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,919 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-01-07 21:41:43,920 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-07 21:41:44,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:44,041 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-01-07 21:41:44,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:44,099 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-01-07 21:41:44,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-07 21:41:44,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:44,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:44,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:44,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:44,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:44,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:44,139 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:44,140 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-01-07 21:41:44,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:44,186 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-01-07 21:41:44,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-07 21:41:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:44,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:44,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:44,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:41:44,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:44,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:41:44,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:41:44,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:41:44,257 INFO L87 Difference]: Start difference. First operand 29 states and 98 transitions. Second operand 8 states. [2019-01-07 21:41:44,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:44,714 INFO L93 Difference]: Finished difference Result 59 states and 140 transitions. [2019-01-07 21:41:44,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:41:44,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:41:44,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:44,716 INFO L225 Difference]: With dead ends: 59 [2019-01-07 21:41:44,717 INFO L226 Difference]: Without dead ends: 55 [2019-01-07 21:41:44,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:41:44,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-07 21:41:44,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-07 21:41:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-07 21:41:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-01-07 21:41:44,726 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-01-07 21:41:44,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:44,726 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-01-07 21:41:44,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:41:44,727 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-01-07 21:41:44,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:44,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:44,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:44,728 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:44,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:44,728 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-01-07 21:41:44,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:44,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:44,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:44,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:44,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:44,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:44,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:44,804 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:44,804 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-01-07 21:41:44,806 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:44,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:44,811 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:44,811 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-01-07 21:41:44,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:44,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:44,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:44,812 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-01-07 21:41:44,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:44,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:44,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:44,853 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 21 treesize of output 24 [2019-01-07 21:41:44,860 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 24 treesize of output 30 [2019-01-07 21:41:44,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:44,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:44,867 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 26 treesize of output 40 [2019-01-07 21:41:44,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:44,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:44,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:44,879 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 28 treesize of output 54 [2019-01-07 21:41:44,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:44,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:44,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:44,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:44,934 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 30 treesize of output 72 [2019-01-07 21:41:44,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:41:44,946 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:44,981 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:45,000 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:45,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:45,032 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:45,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:45,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,075 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 48 treesize of output 54 [2019-01-07 21:41:45,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,118 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 41 treesize of output 53 [2019-01-07 21:41:45,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,163 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 32 treesize of output 61 [2019-01-07 21:41:45,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:41:45,217 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:45,233 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:45,249 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:45,265 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:45,297 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-01-07 21:41:45,297 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-07 21:41:45,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,341 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:41:45,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:45,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:45,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-07 21:41:45,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:45,415 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:45,416 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-07 21:41:45,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:45,450 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-01-07 21:41:45,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-01-07 21:41:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:45,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:45,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:45,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:45,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:41:45,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:45,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:41:45,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:41:45,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:41:45,559 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-01-07 21:41:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:46,000 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-01-07 21:41:46,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:41:46,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:41:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:46,002 INFO L225 Difference]: With dead ends: 57 [2019-01-07 21:41:46,002 INFO L226 Difference]: Without dead ends: 55 [2019-01-07 21:41:46,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:41:46,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-07 21:41:46,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-07 21:41:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-07 21:41:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-01-07 21:41:46,012 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-01-07 21:41:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:46,012 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-01-07 21:41:46,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:41:46,012 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-01-07 21:41:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:46,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:46,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:46,013 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:46,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:46,014 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-01-07 21:41:46,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:46,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:46,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:46,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:46,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:46,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:46,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:46,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:46,122 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:46,122 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-01-07 21:41:46,123 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:46,123 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:46,128 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:46,128 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-01-07 21:41:46,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:46,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:46,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:46,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 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-01-07 21:41:46,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:46,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:46,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:46,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:46,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-07 21:41:46,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:46,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:46,203 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 41 treesize of output 53 [2019-01-07 21:41:46,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:46,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:46,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:46,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:46,264 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 32 treesize of output 61 [2019-01-07 21:41:46,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:46,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:46,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:46,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:46,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:46,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:46,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:41:46,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:46,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:46,413 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:46,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:46,465 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 21 treesize of output 24 [2019-01-07 21:41:46,471 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 24 treesize of output 30 [2019-01-07 21:41:46,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:41:46,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, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:41:46,493 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 30 treesize of output 72 [2019-01-07 21:41:46,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:41:46,509 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:46,901 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:47,053 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:47,070 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:47,083 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:47,096 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:47,130 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-01-07 21:41:47,131 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-07 21:41:47,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,174 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:41:47,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:47,204 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-01-07 21:41:47,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-07 21:41:47,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,239 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-07 21:41:47,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:47,272 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-01-07 21:41:47,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-07 21:41:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:47,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:47,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:47,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:47,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:41:47,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:47,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:41:47,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:41:47,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:41:47,337 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-01-07 21:41:47,527 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-07 21:41:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:47,948 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-01-07 21:41:47,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:41:47,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:41:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:47,950 INFO L225 Difference]: With dead ends: 57 [2019-01-07 21:41:47,950 INFO L226 Difference]: Without dead ends: 53 [2019-01-07 21:41:47,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:41:47,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-07 21:41:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-01-07 21:41:47,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-07 21:41:47,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-01-07 21:41:47,960 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-01-07 21:41:47,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:47,960 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-01-07 21:41:47,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:41:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-01-07 21:41:47,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:47,961 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:47,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:47,962 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:47,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:47,962 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-01-07 21:41:47,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:47,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:47,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:47,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:47,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:48,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:48,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:48,041 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:48,041 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-01-07 21:41:48,045 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:48,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:48,049 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:48,049 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-01-07 21:41:48,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:48,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:48,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:48,050 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-01-07 21:41:48,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:48,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:48,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:48,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,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 48 treesize of output 54 [2019-01-07 21:41:48,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,128 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 41 treesize of output 53 [2019-01-07 21:41:48,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,171 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 32 treesize of output 61 [2019-01-07 21:41:48,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:41:48,220 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,237 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,255 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,296 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 21 treesize of output 24 [2019-01-07 21:41:48,334 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 24 treesize of output 30 [2019-01-07 21:41:48,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:41:48,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:41:48,370 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 30 treesize of output 72 [2019-01-07 21:41:48,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:41:48,385 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,409 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,430 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,447 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,462 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,475 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,510 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-01-07 21:41:48,510 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-07 21:41:48,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:41:48,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,592 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-01-07 21:41:48,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-07 21:41:48,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,633 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-07 21:41:48,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,669 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-01-07 21:41:48,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-07 21:41:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:48,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:48,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:48,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 21:41:48,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:48,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:41:48,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:41:48,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:41:48,721 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-01-07 21:41:49,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:49,168 INFO L93 Difference]: Finished difference Result 73 states and 228 transitions. [2019-01-07 21:41:49,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:41:49,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:41:49,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:49,171 INFO L225 Difference]: With dead ends: 73 [2019-01-07 21:41:49,171 INFO L226 Difference]: Without dead ends: 71 [2019-01-07 21:41:49,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:41:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-07 21:41:49,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 40. [2019-01-07 21:41:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-07 21:41:49,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 173 transitions. [2019-01-07 21:41:49,184 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 173 transitions. Word has length 4 [2019-01-07 21:41:49,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:49,185 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 173 transitions. [2019-01-07 21:41:49,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:41:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 173 transitions. [2019-01-07 21:41:49,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:49,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:49,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:49,186 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:49,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:49,186 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-01-07 21:41:49,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:49,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:49,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:49,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:49,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:49,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:49,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:49,317 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:49,317 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-01-07 21:41:49,318 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:49,318 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:49,329 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:49,330 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-01-07 21:41:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:49,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:49,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:49,331 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-01-07 21:41:49,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:49,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:49,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:49,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 21 treesize of output 24 [2019-01-07 21:41:49,375 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 24 treesize of output 30 [2019-01-07 21:41:49,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,401 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 26 treesize of output 40 [2019-01-07 21:41:49,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,411 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 28 treesize of output 54 [2019-01-07 21:41:49,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,424 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 30 treesize of output 72 [2019-01-07 21:41:49,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:41:49,440 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:49,474 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:49,500 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:49,519 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:49,535 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:49,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:49,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,581 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 48 treesize of output 54 [2019-01-07 21:41:49,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,619 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 41 treesize of output 53 [2019-01-07 21:41:49,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,668 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 32 treesize of output 61 [2019-01-07 21:41:49,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:41:49,721 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:49,738 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:49,753 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:49,769 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:49,800 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-01-07 21:41:49,801 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-07 21:41:49,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:49,897 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:41:49,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:49,926 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-01-07 21:41:49,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-07 21:41:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:49,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:49,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:49,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:49,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:41:49,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:49,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:41:49,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:41:49,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:41:49,970 INFO L87 Difference]: Start difference. First operand 40 states and 173 transitions. Second operand 6 states. [2019-01-07 21:41:50,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:50,202 INFO L93 Difference]: Finished difference Result 56 states and 192 transitions. [2019-01-07 21:41:50,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:41:50,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-07 21:41:50,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:50,204 INFO L225 Difference]: With dead ends: 56 [2019-01-07 21:41:50,204 INFO L226 Difference]: Without dead ends: 55 [2019-01-07 21:41:50,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 21:41:50,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-07 21:41:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-01-07 21:41:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-07 21:41:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 180 transitions. [2019-01-07 21:41:50,215 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 180 transitions. Word has length 4 [2019-01-07 21:41:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:50,215 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 180 transitions. [2019-01-07 21:41:50,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:41:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 180 transitions. [2019-01-07 21:41:50,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:50,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:50,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:50,217 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:50,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:50,217 INFO L82 PathProgramCache]: Analyzing trace with hash 945434, now seen corresponding path program 1 times [2019-01-07 21:41:50,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:50,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:50,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:50,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:50,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:50,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:50,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:50,324 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:50,324 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [27] [2019-01-07 21:41:50,326 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:50,326 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:50,332 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:50,332 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-01-07 21:41:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:50,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:50,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:50,333 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-01-07 21:41:50,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:50,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:50,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:50,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,384 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-01-07 21:41:50,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-07 21:41:50,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,469 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-01-07 21:41:50,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,530 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-01-07 21:41:51,264 WARN L181 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-01-07 21:41:51,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,299 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-01-07 21:41:51,299 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:51,354 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:51,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:51,440 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:51,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:51,550 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 21 treesize of output 24 [2019-01-07 21:41:51,553 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 24 treesize of output 30 [2019-01-07 21:41:51,560 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 26 treesize of output 40 [2019-01-07 21:41:51,564 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 28 treesize of output 54 [2019-01-07 21:41:51,570 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 30 treesize of output 72 [2019-01-07 21:41:51,573 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:41:51,574 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:51,629 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:51,658 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:51,676 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:51,694 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:51,709 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:51,752 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-01-07 21:41:51,752 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-07 21:41:51,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,818 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-01-07 21:41:51,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:51,862 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-01-07 21:41:51,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-07 21:41:51,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,920 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-01-07 21:41:51,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:51,970 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-01-07 21:41:51,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-01-07 21:41:52,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-01-07 21:41:52,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:52,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:52,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 21:41:52,056 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:52,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:41:52,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:41:52,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:41:52,057 INFO L87 Difference]: Start difference. First operand 42 states and 180 transitions. Second operand 8 states. [2019-01-07 21:41:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:52,589 INFO L93 Difference]: Finished difference Result 96 states and 313 transitions. [2019-01-07 21:41:52,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:41:52,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:41:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:52,591 INFO L225 Difference]: With dead ends: 96 [2019-01-07 21:41:52,591 INFO L226 Difference]: Without dead ends: 93 [2019-01-07 21:41:52,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:41:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-07 21:41:52,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 55. [2019-01-07 21:41:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-07 21:41:52,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 250 transitions. [2019-01-07 21:41:52,605 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 250 transitions. Word has length 4 [2019-01-07 21:41:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:52,605 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 250 transitions. [2019-01-07 21:41:52,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:41:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 250 transitions. [2019-01-07 21:41:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:52,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:52,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:52,606 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:52,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:52,607 INFO L82 PathProgramCache]: Analyzing trace with hash 945000, now seen corresponding path program 1 times [2019-01-07 21:41:52,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:52,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:52,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:52,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:52,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:52,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:52,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:52,706 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:52,706 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [27] [2019-01-07 21:41:52,709 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:52,709 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:52,713 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:52,713 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-01-07 21:41:52,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:52,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:52,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:52,714 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-01-07 21:41:52,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:52,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:52,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:52,766 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 21 treesize of output 24 [2019-01-07 21:41:52,782 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 24 treesize of output 30 [2019-01-07 21:41:52,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:52,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:52,833 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 26 treesize of output 40 [2019-01-07 21:41:52,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:52,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:52,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:52,847 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 28 treesize of output 54 [2019-01-07 21:41:52,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:52,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:52,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:52,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:52,862 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 30 treesize of output 72 [2019-01-07 21:41:52,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:41:52,875 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:52,903 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:52,925 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:52,943 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:52,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:52,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:52,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:52,998 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 48 treesize of output 54 [2019-01-07 21:41:53,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-07 21:41:53,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,069 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 32 treesize of output 61 [2019-01-07 21:41:53,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:41:53,118 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:53,135 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:53,150 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:53,166 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:53,199 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-01-07 21:41:53,199 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-07 21:41:53,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,245 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:41:53,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:53,274 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-01-07 21:41:53,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-07 21:41:53,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,301 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-07 21:41:53,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:53,338 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-01-07 21:41:53,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-07 21:41:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:53,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:53,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:53,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:41:53,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:53,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:41:53,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:41:53,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:41:53,408 INFO L87 Difference]: Start difference. First operand 55 states and 250 transitions. Second operand 8 states. [2019-01-07 21:41:53,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:53,887 INFO L93 Difference]: Finished difference Result 84 states and 299 transitions. [2019-01-07 21:41:53,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:41:53,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:41:53,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:53,889 INFO L225 Difference]: With dead ends: 84 [2019-01-07 21:41:53,889 INFO L226 Difference]: Without dead ends: 82 [2019-01-07 21:41:53,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:41:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-07 21:41:53,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-07 21:41:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-07 21:41:53,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 270 transitions. [2019-01-07 21:41:53,903 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 270 transitions. Word has length 4 [2019-01-07 21:41:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:53,904 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 270 transitions. [2019-01-07 21:41:53,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:41:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 270 transitions. [2019-01-07 21:41:53,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:53,905 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:53,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:53,905 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:53,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:53,905 INFO L82 PathProgramCache]: Analyzing trace with hash 946922, now seen corresponding path program 1 times [2019-01-07 21:41:53,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:53,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:53,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:53,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:53,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:53,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:53,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:53,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:53,975 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:53,975 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [27] [2019-01-07 21:41:53,977 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:53,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:53,980 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:53,981 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-01-07 21:41:53,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:53,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:53,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:53,981 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-01-07 21:41:53,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:53,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:53,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:54,021 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 21 treesize of output 24 [2019-01-07 21:41:54,026 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 24 treesize of output 30 [2019-01-07 21:41:54,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:41:54,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,082 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 28 treesize of output 54 [2019-01-07 21:41:54,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,095 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 30 treesize of output 72 [2019-01-07 21:41:54,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,103 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:41:54,104 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,145 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,169 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,201 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,247 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-01-07 21:41:54,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,286 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-01-07 21:41:54,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,331 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-01-07 21:41:54,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,388 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-01-07 21:41:54,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,460 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-01-07 21:41:54,461 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,487 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,513 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,539 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,564 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,610 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-01-07 21:41:54,610 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-07 21:41:54,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,647 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-01-07 21:41:54,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,691 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-01-07 21:41:54,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-07 21:41:54,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,757 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:54,759 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-01-07 21:41:54,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,807 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-01-07 21:41:54,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-07 21:41:54,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:54,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:54,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:54,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:41:54,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:54,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:41:54,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:41:54,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:41:54,886 INFO L87 Difference]: Start difference. First operand 58 states and 270 transitions. Second operand 8 states. [2019-01-07 21:41:55,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:55,657 INFO L93 Difference]: Finished difference Result 91 states and 313 transitions. [2019-01-07 21:41:55,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:41:55,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:41:55,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:55,658 INFO L225 Difference]: With dead ends: 91 [2019-01-07 21:41:55,659 INFO L226 Difference]: Without dead ends: 89 [2019-01-07 21:41:55,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:41:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-07 21:41:55,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-01-07 21:41:55,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-07 21:41:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 277 transitions. [2019-01-07 21:41:55,681 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 277 transitions. Word has length 4 [2019-01-07 21:41:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:55,681 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 277 transitions. [2019-01-07 21:41:55,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:41:55,681 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 277 transitions. [2019-01-07 21:41:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:55,683 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:55,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:55,683 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:55,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:55,683 INFO L82 PathProgramCache]: Analyzing trace with hash 934028, now seen corresponding path program 1 times [2019-01-07 21:41:55,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:55,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:55,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:55,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:55,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:55,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:55,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:55,756 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:55,756 INFO L207 CegarAbsIntRunner]: [0], [10], [28], [29] [2019-01-07 21:41:55,757 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:55,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:55,760 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:55,761 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-01-07 21:41:55,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:55,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:55,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:55,761 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-01-07 21:41:55,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:55,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:55,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:55,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:41:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:41:55,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:55,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:55,802 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 26 treesize of output 36 [2019-01-07 21:41:55,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:55,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:55,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:55,815 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 28 treesize of output 50 [2019-01-07 21:41:55,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:55,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:55,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:55,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:55,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:41:55,852 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-07 21:41:55,853 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:55,882 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:55,903 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:55,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:55,933 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:55,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:55,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-07 21:41:55,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:55,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:55,986 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 36 treesize of output 49 [2019-01-07 21:41:56,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-07 21:41:56,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-07 21:41:56,077 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:56,094 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:56,110 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:56,127 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:56,162 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-01-07 21:41:56,163 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:64, output treesize:67 [2019-01-07 21:41:56,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:41:56,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:41:56,303 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-01-07 21:41:56,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:92 [2019-01-07 21:41:56,553 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2019-01-07 21:41:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:56,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:56,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 21:41:56,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-07 21:41:56,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:41:56,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:41:56,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:41:56,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-07 21:41:56,589 INFO L87 Difference]: Start difference. First operand 59 states and 277 transitions. Second operand 4 states. [2019-01-07 21:41:56,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:56,726 INFO L93 Difference]: Finished difference Result 90 states and 454 transitions. [2019-01-07 21:41:56,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 21:41:56,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 21:41:56,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:56,729 INFO L225 Difference]: With dead ends: 90 [2019-01-07 21:41:56,729 INFO L226 Difference]: Without dead ends: 89 [2019-01-07 21:41:56,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-07 21:41:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-07 21:41:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-01-07 21:41:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-07 21:41:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 449 transitions. [2019-01-07 21:41:56,749 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 449 transitions. Word has length 4 [2019-01-07 21:41:56,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:56,749 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 449 transitions. [2019-01-07 21:41:56,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:41:56,749 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 449 transitions. [2019-01-07 21:41:56,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:56,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:56,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:56,751 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:56,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:56,751 INFO L82 PathProgramCache]: Analyzing trace with hash 933592, now seen corresponding path program 1 times [2019-01-07 21:41:56,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:56,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:56,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:56,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:56,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:56,846 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:56,846 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [27] [2019-01-07 21:41:56,847 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:56,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:56,851 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:56,851 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-01-07 21:41:56,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:56,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:56,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:56,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-01-07 21:41:56,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:56,865 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:56,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:56,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,898 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 48 treesize of output 54 [2019-01-07 21:41:56,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,935 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 41 treesize of output 53 [2019-01-07 21:41:56,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:56,979 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 32 treesize of output 61 [2019-01-07 21:41:57,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:41:57,046 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,108 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,157 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 21 treesize of output 24 [2019-01-07 21:41:57,160 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 24 treesize of output 30 [2019-01-07 21:41:57,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:41:57,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:41:57,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:41:57,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:41:57,178 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,203 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,222 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,237 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,250 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,261 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,292 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-01-07 21:41:57,293 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-07 21:41:57,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,382 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:41:57,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,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-01-07 21:41:57,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-07 21:41:57,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,439 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-07 21:41:57,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,581 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-01-07 21:41:57,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-07 21:41:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:57,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:57,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:57,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:41:57,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:57,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:41:57,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:41:57,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:41:57,641 INFO L87 Difference]: Start difference. First operand 83 states and 449 transitions. Second operand 8 states. [2019-01-07 21:41:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:58,061 INFO L93 Difference]: Finished difference Result 121 states and 532 transitions. [2019-01-07 21:41:58,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:41:58,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:41:58,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:58,064 INFO L225 Difference]: With dead ends: 121 [2019-01-07 21:41:58,064 INFO L226 Difference]: Without dead ends: 119 [2019-01-07 21:41:58,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:41:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-07 21:41:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-01-07 21:41:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-07 21:41:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-01-07 21:41:58,084 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-01-07 21:41:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:58,084 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-01-07 21:41:58,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:41:58,084 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-01-07 21:41:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:58,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:58,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:58,085 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:58,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:58,086 INFO L82 PathProgramCache]: Analyzing trace with hash 937872, now seen corresponding path program 1 times [2019-01-07 21:41:58,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:58,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:58,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:58,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:58,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:58,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:58,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:58,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:58,137 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:58,137 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [29] [2019-01-07 21:41:58,138 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:58,138 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:58,141 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:58,142 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-01-07 21:41:58,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:58,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:58,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:58,142 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-01-07 21:41:58,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:58,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:58,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:58,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:41:58,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:41:58,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,186 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 26 treesize of output 36 [2019-01-07 21:41:58,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,198 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 28 treesize of output 50 [2019-01-07 21:41:58,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:41:58,220 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-07 21:41:58,220 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:58,246 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:58,267 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:58,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:58,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:58,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:58,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-07 21:41:58,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,346 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 36 treesize of output 49 [2019-01-07 21:41:58,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-07 21:41:58,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-07 21:41:58,434 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:58,449 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:58,462 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:58,477 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:58,506 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-01-07 21:41:58,507 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-07 21:41:58,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:58,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-07 21:41:58,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:58,575 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-01-07 21:41:58,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-07 21:41:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:58,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:58,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:58,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:41:58,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:58,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:41:58,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:41:58,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:41:58,680 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 6 states. [2019-01-07 21:41:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:58,920 INFO L93 Difference]: Finished difference Result 110 states and 511 transitions. [2019-01-07 21:41:58,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:41:58,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-07 21:41:58,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:58,921 INFO L225 Difference]: With dead ends: 110 [2019-01-07 21:41:58,921 INFO L226 Difference]: Without dead ends: 109 [2019-01-07 21:41:58,922 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-01-07 21:41:58,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-07 21:41:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2019-01-07 21:41:58,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-07 21:41:58,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-01-07 21:41:58,937 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-01-07 21:41:58,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:58,937 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-01-07 21:41:58,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:41:58,937 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-01-07 21:41:58,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:41:58,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:58,938 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-07 21:41:58,938 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:58,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:58,939 INFO L82 PathProgramCache]: Analyzing trace with hash 29182900, now seen corresponding path program 2 times [2019-01-07 21:41:58,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:58,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:58,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:58,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:58,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:59,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:59,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:59,013 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:41:59,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:41:59,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:59,013 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-01-07 21:41:59,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:41:59,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:41:59,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:41:59,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:41:59,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:59,122 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 21 treesize of output 24 [2019-01-07 21:41:59,139 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 24 treesize of output 30 [2019-01-07 21:41:59,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,148 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 26 treesize of output 40 [2019-01-07 21:41:59,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,156 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 28 treesize of output 54 [2019-01-07 21:41:59,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,179 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 30 treesize of output 72 [2019-01-07 21:41:59,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,190 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:41:59,190 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,233 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,311 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,346 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,392 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-01-07 21:41:59,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,432 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-01-07 21:41:59,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,477 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-01-07 21:41:59,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,545 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-01-07 21:41:59,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,616 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-01-07 21:41:59,617 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,642 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,667 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,693 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,719 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,766 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-01-07 21:41:59,766 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-01-07 21:41:59,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,787 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-01-07 21:41:59,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,833 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-01-07 21:41:59,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-07 21:41:59,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,860 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 103 [2019-01-07 21:41:59,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,908 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-01-07 21:41:59,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:71 [2019-01-07 21:41:59,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,939 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-01-07 21:41:59,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,993 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-01-07 21:41:59,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-01-07 21:42:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:00,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:00,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:00,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:42:00,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:00,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:42:00,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:42:00,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:42:00,701 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 10 states. [2019-01-07 21:42:01,615 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-01-07 21:42:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:02,681 INFO L93 Difference]: Finished difference Result 133 states and 606 transitions. [2019-01-07 21:42:02,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:42:02,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:42:02,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:02,683 INFO L225 Difference]: With dead ends: 133 [2019-01-07 21:42:02,683 INFO L226 Difference]: Without dead ends: 128 [2019-01-07 21:42:02,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:42:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-01-07 21:42:02,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2019-01-07 21:42:02,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-07 21:42:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 538 transitions. [2019-01-07 21:42:02,702 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 538 transitions. Word has length 5 [2019-01-07 21:42:02,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:02,702 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 538 transitions. [2019-01-07 21:42:02,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:42:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 538 transitions. [2019-01-07 21:42:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:02,703 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:02,703 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:02,703 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:02,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:02,703 INFO L82 PathProgramCache]: Analyzing trace with hash 29172052, now seen corresponding path program 1 times [2019-01-07 21:42:02,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:02,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:02,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:42:02,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:02,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:02,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:02,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:02,795 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:02,795 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [29] [2019-01-07 21:42:02,796 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:02,797 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:02,801 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:02,801 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:02,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:02,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:02,801 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-01-07 21:42:02,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:02,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:02,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:02,848 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 21 treesize of output 24 [2019-01-07 21:42:02,850 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 24 treesize of output 30 [2019-01-07 21:42:02,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,855 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 26 treesize of output 40 [2019-01-07 21:42:02,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,862 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 28 treesize of output 54 [2019-01-07 21:42:02,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,869 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 30 treesize of output 72 [2019-01-07 21:42:02,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:42:02,910 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,938 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,961 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,993 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:03,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:03,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,037 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 48 treesize of output 54 [2019-01-07 21:42:03,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,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 41 treesize of output 53 [2019-01-07 21:42:03,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,112 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 32 treesize of output 61 [2019-01-07 21:42:03,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:42:03,160 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:03,175 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:03,189 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:03,206 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:03,236 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-01-07 21:42:03,236 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-07 21:42:03,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,275 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:42:03,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:03,303 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-01-07 21:42:03,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-07 21:42:03,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-07 21:42:03,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:03,367 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-01-07 21:42:03,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-07 21:42:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:03,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:03,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:03,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:03,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:42:03,461 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:03,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:42:03,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:42:03,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:42:03,462 INFO L87 Difference]: Start difference. First operand 95 states and 538 transitions. Second operand 8 states. [2019-01-07 21:42:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:03,788 INFO L93 Difference]: Finished difference Result 125 states and 622 transitions. [2019-01-07 21:42:03,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:42:03,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:42:03,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:03,791 INFO L225 Difference]: With dead ends: 125 [2019-01-07 21:42:03,791 INFO L226 Difference]: Without dead ends: 124 [2019-01-07 21:42:03,792 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-01-07 21:42:03,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-07 21:42:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2019-01-07 21:42:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-07 21:42:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 589 transitions. [2019-01-07 21:42:03,810 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 589 transitions. Word has length 5 [2019-01-07 21:42:03,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:03,810 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 589 transitions. [2019-01-07 21:42:03,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:42:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 589 transitions. [2019-01-07 21:42:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:03,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:03,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:03,811 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:03,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:03,812 INFO L82 PathProgramCache]: Analyzing trace with hash 29187302, now seen corresponding path program 1 times [2019-01-07 21:42:03,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:03,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:03,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:03,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:03,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:03,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:03,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:03,964 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:03,965 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [27] [2019-01-07 21:42:03,966 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:03,966 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:03,969 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:03,969 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:03,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:03,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:03,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:03,970 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-01-07 21:42:03,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:03,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:03,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:04,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,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, 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-01-07 21:42:04,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,063 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-01-07 21:42:04,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,107 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-01-07 21:42:04,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,162 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-01-07 21:42:04,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,231 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-01-07 21:42:04,232 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:04,257 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:04,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:04,328 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:04,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:04,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:42:04,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:42:04,394 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 26 treesize of output 40 [2019-01-07 21:42:04,397 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 28 treesize of output 54 [2019-01-07 21:42:04,401 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 30 treesize of output 72 [2019-01-07 21:42:04,405 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:42:04,405 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:04,439 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:04,458 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:04,474 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:04,486 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:04,498 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:04,577 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-01-07 21:42:04,577 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-07 21:42:04,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,613 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-01-07 21:42:04,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:04,656 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-01-07 21:42:04,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-07 21:42:04,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,699 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-01-07 21:42:04,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:04,748 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-01-07 21:42:04,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-07 21:42:04,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,812 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:04,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,814 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-01-07 21:42:04,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:04,874 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-01-07 21:42:04,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-07 21:42:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:04,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:04,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-01-07 21:42:04,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:04,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:42:04,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:04,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:42:04,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:42:04,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:42:04,961 INFO L87 Difference]: Start difference. First operand 102 states and 589 transitions. Second operand 10 states. [2019-01-07 21:42:06,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:06,441 INFO L93 Difference]: Finished difference Result 149 states and 665 transitions. [2019-01-07 21:42:06,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:42:06,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:42:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:06,443 INFO L225 Difference]: With dead ends: 149 [2019-01-07 21:42:06,443 INFO L226 Difference]: Without dead ends: 145 [2019-01-07 21:42:06,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:42:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-07 21:42:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 105. [2019-01-07 21:42:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-07 21:42:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 605 transitions. [2019-01-07 21:42:06,466 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 605 transitions. Word has length 5 [2019-01-07 21:42:06,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:06,466 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 605 transitions. [2019-01-07 21:42:06,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:42:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 605 transitions. [2019-01-07 21:42:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:06,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:06,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:06,467 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:06,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:06,467 INFO L82 PathProgramCache]: Analyzing trace with hash 29186868, now seen corresponding path program 1 times [2019-01-07 21:42:06,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:06,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:06,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:06,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:06,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:06,621 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-07 21:42:06,780 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-07 21:42:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:07,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:07,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:07,017 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:07,018 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [27] [2019-01-07 21:42:07,018 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:07,019 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:07,021 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:07,022 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:07,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:07,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:07,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:07,022 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-01-07 21:42:07,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:07,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:07,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:07,104 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 21 treesize of output 24 [2019-01-07 21:42:07,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, 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 30 [2019-01-07 21:42:07,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:42:07,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,138 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 28 treesize of output 54 [2019-01-07 21:42:07,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,147 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 30 treesize of output 72 [2019-01-07 21:42:07,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:42:07,156 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:07,184 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:07,204 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:07,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:07,234 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:07,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:07,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,274 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 48 treesize of output 54 [2019-01-07 21:42:07,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,305 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 41 treesize of output 53 [2019-01-07 21:42:07,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,341 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 32 treesize of output 61 [2019-01-07 21:42:07,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:42:07,389 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:07,403 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:07,418 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:07,433 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:07,464 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-01-07 21:42:07,464 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-07 21:42:07,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,516 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:42:07,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:07,543 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-01-07 21:42:07,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-07 21:42:07,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-07 21:42:07,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:07,606 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-01-07 21:42:07,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-07 21:42:07,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,638 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:07,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,640 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-07 21:42:07,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:07,673 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-01-07 21:42:07,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-07 21:42:07,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:07,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:07,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:07,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:07,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:42:07,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:07,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:42:07,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:42:07,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:42:07,753 INFO L87 Difference]: Start difference. First operand 105 states and 605 transitions. Second operand 10 states. [2019-01-07 21:42:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:08,273 INFO L93 Difference]: Finished difference Result 138 states and 662 transitions. [2019-01-07 21:42:08,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:42:08,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:42:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:08,276 INFO L225 Difference]: With dead ends: 138 [2019-01-07 21:42:08,276 INFO L226 Difference]: Without dead ends: 136 [2019-01-07 21:42:08,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:42:08,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-07 21:42:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2019-01-07 21:42:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-07 21:42:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 598 transitions. [2019-01-07 21:42:08,295 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 598 transitions. Word has length 5 [2019-01-07 21:42:08,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:08,295 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 598 transitions. [2019-01-07 21:42:08,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:42:08,295 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 598 transitions. [2019-01-07 21:42:08,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:08,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:08,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:08,296 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:08,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:08,297 INFO L82 PathProgramCache]: Analyzing trace with hash 29188666, now seen corresponding path program 1 times [2019-01-07 21:42:08,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:08,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:08,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:08,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:08,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:08,658 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-01-07 21:42:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:08,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:08,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:08,981 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:08,981 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [27] [2019-01-07 21:42:08,982 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:08,982 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:08,989 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:08,989 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:08,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:08,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:08,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:08,990 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-01-07 21:42:09,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:09,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:09,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:09,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,035 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-01-07 21:42:09,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,070 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-01-07 21:42:09,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,119 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-01-07 21:42:09,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,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, 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-01-07 21:42:09,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,247 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-01-07 21:42:09,247 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,273 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,323 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,384 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 21 treesize of output 24 [2019-01-07 21:42:09,387 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 24 treesize of output 30 [2019-01-07 21:42:09,390 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 26 treesize of output 40 [2019-01-07 21:42:09,393 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 28 treesize of output 54 [2019-01-07 21:42:09,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:42:09,422 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:42:09,423 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,736 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,755 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,770 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,783 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,794 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,837 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-01-07 21:42:09,837 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-07 21:42:09,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,861 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-01-07 21:42:09,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,900 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-01-07 21:42:09,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-07 21:42:09,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,964 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:09,965 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-01-07 21:42:09,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:10,010 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-01-07 21:42:10,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-07 21:42:10,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,045 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-01-07 21:42:10,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:10,092 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-01-07 21:42:10,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-07 21:42:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:10,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:10,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:10,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:42:10,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:10,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:42:10,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:42:10,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:42:10,158 INFO L87 Difference]: Start difference. First operand 104 states and 598 transitions. Second operand 10 states. [2019-01-07 21:42:10,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:10,711 INFO L93 Difference]: Finished difference Result 152 states and 738 transitions. [2019-01-07 21:42:10,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:42:10,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:42:10,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:10,716 INFO L225 Difference]: With dead ends: 152 [2019-01-07 21:42:10,716 INFO L226 Difference]: Without dead ends: 151 [2019-01-07 21:42:10,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:42:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-07 21:42:10,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 106. [2019-01-07 21:42:10,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-07 21:42:10,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 612 transitions. [2019-01-07 21:42:10,735 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 612 transitions. Word has length 5 [2019-01-07 21:42:10,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:10,735 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 612 transitions. [2019-01-07 21:42:10,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:42:10,735 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 612 transitions. [2019-01-07 21:42:10,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:10,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:10,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:10,736 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:10,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:10,736 INFO L82 PathProgramCache]: Analyzing trace with hash 29188790, now seen corresponding path program 1 times [2019-01-07 21:42:10,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:10,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:10,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:10,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:10,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:10,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:10,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:10,849 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:10,849 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [27] [2019-01-07 21:42:10,850 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:10,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:10,852 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:10,852 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:10,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:10,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:10,853 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-01-07 21:42:10,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:10,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:10,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:10,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,908 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-01-07 21:42:10,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-07 21:42:10,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-07 21:42:11,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,068 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-01-07 21:42:11,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,143 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-01-07 21:42:11,144 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:11,205 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:11,233 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:11,263 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:11,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:11,332 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 21 treesize of output 24 [2019-01-07 21:42:11,335 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 24 treesize of output 30 [2019-01-07 21:42:11,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, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:42:11,341 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 28 treesize of output 54 [2019-01-07 21:42:11,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:42:11,348 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:42:11,348 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:11,385 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:11,404 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:11,420 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:11,432 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:11,444 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:11,486 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-01-07 21:42:11,487 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-07 21:42:11,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,521 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-01-07 21:42:11,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:11,561 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-01-07 21:42:11,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-07 21:42:11,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,602 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:11,603 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-01-07 21:42:11,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:11,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-01-07 21:42:11,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-01-07 21:42:11,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,682 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:11,682 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-01-07 21:42:11,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:11,875 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-01-07 21:42:11,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:57 [2019-01-07 21:42:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:13,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:13,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:13,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:42:13,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:13,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:42:13,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:42:13,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:42:13,353 INFO L87 Difference]: Start difference. First operand 106 states and 612 transitions. Second operand 10 states. [2019-01-07 21:42:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:14,072 INFO L93 Difference]: Finished difference Result 141 states and 665 transitions. [2019-01-07 21:42:14,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:42:14,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:42:14,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:14,075 INFO L225 Difference]: With dead ends: 141 [2019-01-07 21:42:14,075 INFO L226 Difference]: Without dead ends: 140 [2019-01-07 21:42:14,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:42:14,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-07 21:42:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2019-01-07 21:42:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-07 21:42:14,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 619 transitions. [2019-01-07 21:42:14,097 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 619 transitions. Word has length 5 [2019-01-07 21:42:14,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:14,097 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 619 transitions. [2019-01-07 21:42:14,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:42:14,098 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 619 transitions. [2019-01-07 21:42:14,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:14,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:14,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:14,099 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:14,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:14,099 INFO L82 PathProgramCache]: Analyzing trace with hash 29175212, now seen corresponding path program 1 times [2019-01-07 21:42:14,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:14,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:14,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:14,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:14,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:14,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:14,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:14,187 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:14,187 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [27] [2019-01-07 21:42:14,190 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:14,190 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:14,194 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:14,194 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:14,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:14,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:14,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:14,195 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-01-07 21:42:14,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:14,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:14,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:14,235 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 21 treesize of output 24 [2019-01-07 21:42:14,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 24 treesize of output 30 [2019-01-07 21:42:14,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,245 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 26 treesize of output 40 [2019-01-07 21:42:14,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,258 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 28 treesize of output 54 [2019-01-07 21:42:14,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,289 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 30 treesize of output 72 [2019-01-07 21:42:14,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:42:14,300 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:14,330 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:14,355 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:14,374 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:14,389 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:14,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:14,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,434 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 48 treesize of output 54 [2019-01-07 21:42:14,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,472 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 41 treesize of output 53 [2019-01-07 21:42:14,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,511 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 32 treesize of output 61 [2019-01-07 21:42:14,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:42:14,565 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:14,584 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:14,601 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:14,618 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:14,654 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-01-07 21:42:14,654 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-07 21:42:14,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,703 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:42:14,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:14,729 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-01-07 21:42:14,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-07 21:42:14,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,752 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:14,753 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-07 21:42:14,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:14,791 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-01-07 21:42:14,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-01-07 21:42:14,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:14,823 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-07 21:42:14,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:14,854 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-01-07 21:42:14,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-07 21:42:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:14,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:14,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:14,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:42:14,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:14,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:42:14,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:42:14,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:42:14,914 INFO L87 Difference]: Start difference. First operand 107 states and 619 transitions. Second operand 10 states. [2019-01-07 21:42:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:15,484 INFO L93 Difference]: Finished difference Result 163 states and 816 transitions. [2019-01-07 21:42:15,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:42:15,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:42:15,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:15,487 INFO L225 Difference]: With dead ends: 163 [2019-01-07 21:42:15,487 INFO L226 Difference]: Without dead ends: 162 [2019-01-07 21:42:15,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:42:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-07 21:42:15,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 116. [2019-01-07 21:42:15,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-07 21:42:15,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 682 transitions. [2019-01-07 21:42:15,512 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 682 transitions. Word has length 5 [2019-01-07 21:42:15,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:15,512 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 682 transitions. [2019-01-07 21:42:15,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:42:15,513 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 682 transitions. [2019-01-07 21:42:15,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:15,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:15,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:15,514 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:15,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:15,514 INFO L82 PathProgramCache]: Analyzing trace with hash 29179614, now seen corresponding path program 1 times [2019-01-07 21:42:15,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:15,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:15,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:15,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:15,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:15,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:15,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:15,588 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:15,588 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [27] [2019-01-07 21:42:15,589 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:15,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:15,592 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:15,593 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:15,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:15,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:15,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:15,593 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-01-07 21:42:15,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:15,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:15,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:15,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,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-01-07 21:42:15,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,675 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-01-07 21:42:15,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,718 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-01-07 21:42:15,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,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, 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-01-07 21:42:15,906 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-01-07 21:42:15,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,917 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-01-07 21:42:15,918 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:15,943 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:15,968 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:15,993 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:16,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:16,053 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 21 treesize of output 24 [2019-01-07 21:42:16,055 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 24 treesize of output 30 [2019-01-07 21:42:16,058 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 26 treesize of output 40 [2019-01-07 21:42:16,061 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 28 treesize of output 54 [2019-01-07 21:42:16,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:42:16,068 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:42:16,068 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:16,101 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:16,121 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:16,136 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:16,148 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:16,159 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:16,202 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-01-07 21:42:16,202 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-07 21:42:16,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,246 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-01-07 21:42:16,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:16,287 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-01-07 21:42:16,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-07 21:42:16,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,325 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-01-07 21:42:16,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:16,370 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-01-07 21:42:16,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-07 21:42:16,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,407 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:16,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,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, 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-01-07 21:42:16,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:16,456 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-01-07 21:42:16,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-07 21:42:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:16,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:16,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:16,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:42:16,536 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:16,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:42:16,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:42:16,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:42:16,536 INFO L87 Difference]: Start difference. First operand 116 states and 682 transitions. Second operand 10 states. [2019-01-07 21:42:17,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:17,207 INFO L93 Difference]: Finished difference Result 163 states and 796 transitions. [2019-01-07 21:42:17,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:42:17,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:42:17,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:17,210 INFO L225 Difference]: With dead ends: 163 [2019-01-07 21:42:17,210 INFO L226 Difference]: Without dead ends: 160 [2019-01-07 21:42:17,210 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-01-07 21:42:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-07 21:42:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2019-01-07 21:42:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-07 21:42:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 724 transitions. [2019-01-07 21:42:17,234 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 724 transitions. Word has length 5 [2019-01-07 21:42:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:17,235 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 724 transitions. [2019-01-07 21:42:17,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:42:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 724 transitions. [2019-01-07 21:42:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:17,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:17,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:17,236 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:17,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:17,236 INFO L82 PathProgramCache]: Analyzing trace with hash 29179180, now seen corresponding path program 1 times [2019-01-07 21:42:17,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:17,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:17,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:17,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:17,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:17,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:17,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:17,357 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:17,357 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [27] [2019-01-07 21:42:17,358 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:17,358 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:17,361 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:17,361 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:17,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:17,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:17,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:17,362 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-01-07 21:42:17,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:17,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:17,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:17,499 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-07 21:42:17,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,503 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 48 treesize of output 54 [2019-01-07 21:42:17,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,535 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 41 treesize of output 53 [2019-01-07 21:42:17,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,571 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 32 treesize of output 61 [2019-01-07 21:42:17,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:42:17,620 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:17,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:17,652 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:17,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:17,690 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 21 treesize of output 24 [2019-01-07 21:42:17,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:42:17,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, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:42:17,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:42:17,704 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 30 treesize of output 72 [2019-01-07 21:42:17,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:42:17,712 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:17,737 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:17,756 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:17,771 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:17,784 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:17,795 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:17,825 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-01-07 21:42:17,826 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-07 21:42:17,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,874 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:42:17,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:17,900 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-01-07 21:42:17,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-07 21:42:17,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:17,932 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-07 21:42:17,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:17,968 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-01-07 21:42:17,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-07 21:42:18,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,037 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:18,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,039 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-07 21:42:18,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:18,072 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-01-07 21:42:18,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-07 21:42:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:18,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:18,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:18,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:42:18,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:18,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:42:18,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:42:18,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:42:18,150 INFO L87 Difference]: Start difference. First operand 122 states and 724 transitions. Second operand 10 states. [2019-01-07 21:42:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:18,671 INFO L93 Difference]: Finished difference Result 165 states and 829 transitions. [2019-01-07 21:42:18,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:42:18,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:42:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:18,674 INFO L225 Difference]: With dead ends: 165 [2019-01-07 21:42:18,674 INFO L226 Difference]: Without dead ends: 163 [2019-01-07 21:42:18,675 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-01-07 21:42:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-07 21:42:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2019-01-07 21:42:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-07 21:42:18,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 745 transitions. [2019-01-07 21:42:18,696 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 745 transitions. Word has length 5 [2019-01-07 21:42:18,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:18,697 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 745 transitions. [2019-01-07 21:42:18,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:42:18,697 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 745 transitions. [2019-01-07 21:42:18,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:18,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:18,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:18,697 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:18,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:18,698 INFO L82 PathProgramCache]: Analyzing trace with hash 28829936, now seen corresponding path program 1 times [2019-01-07 21:42:18,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:18,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:18,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:18,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:18,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:42:18,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:18,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:18,737 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:18,738 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [29] [2019-01-07 21:42:18,738 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:18,738 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:18,741 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:18,741 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:18,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:18,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:18,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:18,742 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-01-07 21:42:18,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:18,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:18,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:18,787 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 21 treesize of output 24 [2019-01-07 21:42:18,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, 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 30 [2019-01-07 21:42:18,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,803 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 26 treesize of output 40 [2019-01-07 21:42:18,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,811 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 28 treesize of output 54 [2019-01-07 21:42:18,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,819 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 30 treesize of output 72 [2019-01-07 21:42:18,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:42:18,829 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:18,856 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:18,877 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:18,894 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:18,906 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:18,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:18,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,947 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 48 treesize of output 54 [2019-01-07 21:42:18,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:18,976 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 41 treesize of output 53 [2019-01-07 21:42:19,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-07 21:42:19,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:42:19,061 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:19,077 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:19,092 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:19,107 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:19,138 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-01-07 21:42:19,138 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-07 21:42:19,645 WARN L181 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-07 21:42:19,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,650 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:42:19,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:19,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:19,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-07 21:42:19,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,703 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:19,704 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-07 21:42:19,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:19,735 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-01-07 21:42:19,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-07 21:42:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:19,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:19,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:19,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-07 21:42:19,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:19,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 21:42:19,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 21:42:19,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:42:19,791 INFO L87 Difference]: Start difference. First operand 125 states and 745 transitions. Second operand 7 states. [2019-01-07 21:42:20,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:20,061 INFO L93 Difference]: Finished difference Result 158 states and 796 transitions. [2019-01-07 21:42:20,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:42:20,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-07 21:42:20,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:20,064 INFO L225 Difference]: With dead ends: 158 [2019-01-07 21:42:20,064 INFO L226 Difference]: Without dead ends: 156 [2019-01-07 21:42:20,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:42:20,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-07 21:42:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2019-01-07 21:42:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-07 21:42:20,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 760 transitions. [2019-01-07 21:42:20,087 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 760 transitions. Word has length 5 [2019-01-07 21:42:20,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:20,087 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 760 transitions. [2019-01-07 21:42:20,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 21:42:20,087 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 760 transitions. [2019-01-07 21:42:20,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:20,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:20,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:20,088 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:20,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:20,088 INFO L82 PathProgramCache]: Analyzing trace with hash 28831546, now seen corresponding path program 2 times [2019-01-07 21:42:20,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:20,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:20,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:20,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:20,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:20,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:20,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:20,201 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:42:20,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:42:20,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:20,202 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-01-07 21:42:20,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:42:20,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:42:20,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:42:20,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:42:20,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:20,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,241 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-01-07 21:42:20,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-07 21:42:20,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,330 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-01-07 21:42:20,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,383 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-01-07 21:42:20,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,451 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-01-07 21:42:20,452 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:20,477 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:20,503 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:20,531 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:20,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:20,593 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 21 treesize of output 24 [2019-01-07 21:42:20,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 24 treesize of output 30 [2019-01-07 21:42:20,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 26 treesize of output 40 [2019-01-07 21:42:20,603 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 28 treesize of output 54 [2019-01-07 21:42:20,606 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 30 treesize of output 72 [2019-01-07 21:42:20,609 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:42:20,610 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:20,644 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:20,664 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:20,680 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:20,692 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:20,704 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:20,748 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-01-07 21:42:20,748 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-07 21:42:20,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,775 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-01-07 21:42:20,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:20,817 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-01-07 21:42:20,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-07 21:42:20,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,849 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-01-07 21:42:20,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:20,908 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-01-07 21:42:20,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-07 21:42:20,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,963 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:20,964 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-01-07 21:42:20,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:21,008 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-01-07 21:42:21,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-07 21:42:21,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:21,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:21,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:21,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-07 21:42:21,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:21,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:42:21,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:42:21,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:42:21,075 INFO L87 Difference]: Start difference. First operand 128 states and 760 transitions. Second operand 10 states. [2019-01-07 21:42:21,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:21,745 INFO L93 Difference]: Finished difference Result 241 states and 1191 transitions. [2019-01-07 21:42:21,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:42:21,745 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:42:21,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:21,748 INFO L225 Difference]: With dead ends: 241 [2019-01-07 21:42:21,748 INFO L226 Difference]: Without dead ends: 235 [2019-01-07 21:42:21,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:42:21,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-07 21:42:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 164. [2019-01-07 21:42:21,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-07 21:42:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 1007 transitions. [2019-01-07 21:42:21,785 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 1007 transitions. Word has length 5 [2019-01-07 21:42:21,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:21,786 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 1007 transitions. [2019-01-07 21:42:21,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:42:21,786 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 1007 transitions. [2019-01-07 21:42:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:21,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:21,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:21,787 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:21,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:21,787 INFO L82 PathProgramCache]: Analyzing trace with hash 28831858, now seen corresponding path program 1 times [2019-01-07 21:42:21,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:21,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:21,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:42:21,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:21,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:42:22,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:22,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:22,167 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:22,167 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [29] [2019-01-07 21:42:22,168 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:22,169 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:22,172 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:22,172 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:22,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:22,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:22,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:22,173 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-01-07 21:42:22,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:22,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:22,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:22,217 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 21 treesize of output 24 [2019-01-07 21:42:22,221 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 24 treesize of output 30 [2019-01-07 21:42:22,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,226 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 26 treesize of output 40 [2019-01-07 21:42:22,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,232 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 28 treesize of output 54 [2019-01-07 21:42:22,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,241 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 30 treesize of output 72 [2019-01-07 21:42:22,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:42:22,253 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:22,285 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:22,308 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:22,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:22,357 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:22,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:22,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,397 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 48 treesize of output 54 [2019-01-07 21:42:22,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,428 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 41 treesize of output 53 [2019-01-07 21:42:22,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,467 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 32 treesize of output 61 [2019-01-07 21:42:22,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:42:22,513 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:22,534 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:22,549 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:22,564 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:22,595 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-01-07 21:42:22,595 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-07 21:42:22,834 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-07 21:42:22,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:22,973 INFO L303 Elim1Store]: Index analysis took 136 ms [2019-01-07 21:42:22,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-07 21:42:22,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:42:23,083 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-01-07 21:42:23,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:106 [2019-01-07 21:42:23,290 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-07 21:42:23,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,299 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:23,299 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 72 [2019-01-07 21:42:23,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:23,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,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, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 107 [2019-01-07 21:42:23,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-01-07 21:42:23,738 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-01-07 21:42:23,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:126, output treesize:280 [2019-01-07 21:42:28,005 WARN L181 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 171 DAG size of output: 90 [2019-01-07 21:42:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:28,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:28,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:28,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:42:28,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:28,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:42:28,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:42:28,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:42:28,116 INFO L87 Difference]: Start difference. First operand 164 states and 1007 transitions. Second operand 8 states. [2019-01-07 21:42:28,579 WARN L181 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-07 21:42:29,046 WARN L181 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-01-07 21:42:29,662 WARN L181 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2019-01-07 21:42:29,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:29,958 INFO L93 Difference]: Finished difference Result 208 states and 1150 transitions. [2019-01-07 21:42:29,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:42:29,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:42:29,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:29,961 INFO L225 Difference]: With dead ends: 208 [2019-01-07 21:42:29,961 INFO L226 Difference]: Without dead ends: 207 [2019-01-07 21:42:29,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:42:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-07 21:42:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2019-01-07 21:42:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-07 21:42:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 1128 transitions. [2019-01-07 21:42:29,993 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 1128 transitions. Word has length 5 [2019-01-07 21:42:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:29,993 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 1128 transitions. [2019-01-07 21:42:29,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:42:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 1128 transitions. [2019-01-07 21:42:29,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:29,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:29,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:29,994 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:29,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:29,995 INFO L82 PathProgramCache]: Analyzing trace with hash 28818278, now seen corresponding path program 1 times [2019-01-07 21:42:29,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:29,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:29,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:29,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:29,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:30,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:30,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:30,152 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:30,152 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [27] [2019-01-07 21:42:30,153 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:30,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:30,155 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:30,155 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:30,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:30,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:30,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:30,156 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-01-07 21:42:30,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:30,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:30,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:30,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:30,189 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 48 treesize of output 54 [2019-01-07 21:42:30,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:30,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:30,221 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 41 treesize of output 53 [2019-01-07 21:42:30,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:30,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:30,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:30,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:30,259 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 32 treesize of output 61 [2019-01-07 21:42:30,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:30,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:30,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:30,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:30,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:30,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:30,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:42:30,306 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:30,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:30,336 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:30,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:30,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:42:30,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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:42:30,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:42:30,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:42:30,387 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 30 treesize of output 72 [2019-01-07 21:42:30,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:42:30,396 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:30,421 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:30,440 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:30,455 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:30,468 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:30,479 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:30,509 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-01-07 21:42:30,510 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-07 21:42:30,725 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-07 21:42:30,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:30,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-07 21:42:30,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:42:30,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-01-07 21:42:30,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-01-07 21:42:31,083 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-07 21:42:31,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,111 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 2 case distinctions, treesize of input 65 treesize of output 103 [2019-01-07 21:42:31,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:42:31,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,276 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 89 [2019-01-07 21:42:31,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:31,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-07 21:42:31,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:129, output treesize:125 [2019-01-07 21:42:31,592 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-07 21:42:31,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,631 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:31,655 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 6 case distinctions, treesize of input 55 treesize of output 118 [2019-01-07 21:42:31,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-07 21:42:31,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,944 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:31,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:31,946 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-07 21:42:31,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:32,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:32,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:32,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:32,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:32,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:32,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:32,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:32,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:32,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:32,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:32,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:32,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:32,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:32,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, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 110 [2019-01-07 21:42:32,101 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:32,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-07 21:42:32,251 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:242 [2019-01-07 21:42:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:32,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:32,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:32,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:42:32,436 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:32,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:42:32,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:42:32,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:42:32,437 INFO L87 Difference]: Start difference. First operand 181 states and 1128 transitions. Second operand 10 states. [2019-01-07 21:42:33,268 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-01-07 21:42:33,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:33,778 INFO L93 Difference]: Finished difference Result 280 states and 1534 transitions. [2019-01-07 21:42:33,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-07 21:42:33,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:42:33,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:33,782 INFO L225 Difference]: With dead ends: 280 [2019-01-07 21:42:33,782 INFO L226 Difference]: Without dead ends: 279 [2019-01-07 21:42:33,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:42:33,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-07 21:42:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 185. [2019-01-07 21:42:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-07 21:42:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 1156 transitions. [2019-01-07 21:42:33,827 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 1156 transitions. Word has length 5 [2019-01-07 21:42:33,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:33,827 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 1156 transitions. [2019-01-07 21:42:33,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:42:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 1156 transitions. [2019-01-07 21:42:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:33,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:33,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:33,828 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:33,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:33,828 INFO L82 PathProgramCache]: Analyzing trace with hash 28835766, now seen corresponding path program 1 times [2019-01-07 21:42:33,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:33,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:33,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:33,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:33,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:34,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:42:34,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:42:34,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 21:42:34,087 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:42:34,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:42:34,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:42:34,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-07 21:42:34,088 INFO L87 Difference]: Start difference. First operand 185 states and 1156 transitions. Second operand 4 states. [2019-01-07 21:42:34,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:34,187 INFO L93 Difference]: Finished difference Result 201 states and 1179 transitions. [2019-01-07 21:42:34,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 21:42:34,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-07 21:42:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:34,190 INFO L225 Difference]: With dead ends: 201 [2019-01-07 21:42:34,190 INFO L226 Difference]: Without dead ends: 198 [2019-01-07 21:42:34,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-07 21:42:34,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-07 21:42:34,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-01-07 21:42:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-07 21:42:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 1164 transitions. [2019-01-07 21:42:34,234 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 1164 transitions. Word has length 5 [2019-01-07 21:42:34,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:34,234 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 1164 transitions. [2019-01-07 21:42:34,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:42:34,234 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 1164 transitions. [2019-01-07 21:42:34,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:34,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:34,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:34,235 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:34,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:34,235 INFO L82 PathProgramCache]: Analyzing trace with hash 28822248, now seen corresponding path program 1 times [2019-01-07 21:42:34,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:34,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:34,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:34,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:34,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:42:34,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:34,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:34,295 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:34,295 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [29] [2019-01-07 21:42:34,296 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:34,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:34,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:34,298 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:34,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:34,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:34,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42: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 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-01-07 21:42:34,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:34,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:34,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:34,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,342 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 48 treesize of output 54 [2019-01-07 21:42:34,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,381 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 41 treesize of output 53 [2019-01-07 21:42:34,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,423 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 32 treesize of output 61 [2019-01-07 21:42:34,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:42:34,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:34,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:34,524 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:34,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:34,578 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 21 treesize of output 24 [2019-01-07 21:42:34,582 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 24 treesize of output 30 [2019-01-07 21:42:34,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:42:34,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:42:34,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:42:34,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:42:34,602 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:34,629 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:34,651 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:34,668 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:34,682 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:34,694 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:34,736 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-01-07 21:42:34,736 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-07 21:42:34,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:42:34,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:34,801 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-01-07 21:42:34,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-07 21:42:34,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:34,827 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:34,828 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-07 21:42:34,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:34,856 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-01-07 21:42:34,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-07 21:42:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:34,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:34,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:34,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:42:34,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:34,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:42:34,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:42:34,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:42:34,920 INFO L87 Difference]: Start difference. First operand 187 states and 1164 transitions. Second operand 8 states. [2019-01-07 21:42:35,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:35,224 INFO L93 Difference]: Finished difference Result 208 states and 1202 transitions. [2019-01-07 21:42:35,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:42:35,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:42:35,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:35,228 INFO L225 Difference]: With dead ends: 208 [2019-01-07 21:42:35,228 INFO L226 Difference]: Without dead ends: 207 [2019-01-07 21:42:35,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:42:35,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-07 21:42:35,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-01-07 21:42:35,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-07 21:42:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 1178 transitions. [2019-01-07 21:42:35,265 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 1178 transitions. Word has length 5 [2019-01-07 21:42:35,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:35,265 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 1178 transitions. [2019-01-07 21:42:35,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:42:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 1178 transitions. [2019-01-07 21:42:35,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:35,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:35,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:35,267 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:35,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:35,267 INFO L82 PathProgramCache]: Analyzing trace with hash 29302748, now seen corresponding path program 1 times [2019-01-07 21:42:35,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:35,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:35,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:35,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:35,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:35,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:35,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:35,364 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:35,364 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [29] [2019-01-07 21:42:35,364 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:35,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:35,368 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:35,368 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:35,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:35,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:35,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:35,369 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-01-07 21:42:35,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:35,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:35,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:35,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-07 21:42:35,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,403 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 36 treesize of output 49 [2019-01-07 21:42:35,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-07 21:42:35,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-07 21:42:35,504 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:35,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:35,540 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:35,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:35,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:42:35,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 26 [2019-01-07 21:42:35,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-07 21:42:35,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-07 21:42:35,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:42:35,611 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-07 21:42:35,611 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:35,635 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:35,652 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:35,666 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:35,677 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:35,688 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:35,716 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-01-07 21:42:35,716 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-07 21:42:35,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-07 21:42:35,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:35,783 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-01-07 21:42:35,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-07 21:42:35,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:35,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-01-07 21:42:35,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:35,837 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-01-07 21:42:35,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-07 21:42:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:35,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:35,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:35,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:35,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:42:35,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:35,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:42:35,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:42:35,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:42:35,897 INFO L87 Difference]: Start difference. First operand 189 states and 1178 transitions. Second operand 8 states. [2019-01-07 21:42:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:36,186 INFO L93 Difference]: Finished difference Result 210 states and 1196 transitions. [2019-01-07 21:42:36,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:42:36,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:42:36,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:36,189 INFO L225 Difference]: With dead ends: 210 [2019-01-07 21:42:36,190 INFO L226 Difference]: Without dead ends: 208 [2019-01-07 21:42:36,190 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-01-07 21:42:36,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-07 21:42:36,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-01-07 21:42:36,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-07 21:42:36,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1179 transitions. [2019-01-07 21:42:36,230 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1179 transitions. Word has length 5 [2019-01-07 21:42:36,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:36,230 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1179 transitions. [2019-01-07 21:42:36,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:42:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1179 transitions. [2019-01-07 21:42:36,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:36,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:36,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:36,231 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:36,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:36,231 INFO L82 PathProgramCache]: Analyzing trace with hash 29308202, now seen corresponding path program 2 times [2019-01-07 21:42:36,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:36,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:36,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:36,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:36,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:36,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:36,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:36,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:42:36,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:42:36,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:36,370 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-01-07 21:42:36,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:42:36,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:42:36,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:42:36,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:42:36,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:36,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,409 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-01-07 21:42:36,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,445 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-01-07 21:42:36,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-07 21:42:36,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,550 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-01-07 21:42:36,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:36,653 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-01-07 21:42:36,654 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:36,685 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:36,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:36,747 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:36,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:36,820 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 21 treesize of output 24 [2019-01-07 21:42:36,822 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 24 treesize of output 30 [2019-01-07 21:42:36,824 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 26 treesize of output 40 [2019-01-07 21:42:36,826 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 28 treesize of output 54 [2019-01-07 21:42:36,828 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 30 treesize of output 72 [2019-01-07 21:42:36,834 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:42:36,835 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:37,159 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:37,177 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:37,192 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:37,204 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:37,216 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:37,258 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-01-07 21:42:37,259 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-07 21:42:37,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,290 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-01-07 21:42:37,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:37,332 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-01-07 21:42:37,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-07 21:42:37,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,371 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-01-07 21:42:37,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:37,419 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-01-07 21:42:37,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-07 21:42:37,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,459 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:37,460 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 124 [2019-01-07 21:42:37,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:37,508 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-01-07 21:42:37,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-07 21:42:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:37,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:37,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-01-07 21:42:37,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:37,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:42:37,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:37,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:42:37,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:42:37,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:42:37,591 INFO L87 Difference]: Start difference. First operand 191 states and 1179 transitions. Second operand 10 states. [2019-01-07 21:42:39,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:39,198 INFO L93 Difference]: Finished difference Result 242 states and 1308 transitions. [2019-01-07 21:42:39,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:42:39,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:42:39,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:39,202 INFO L225 Difference]: With dead ends: 242 [2019-01-07 21:42:39,202 INFO L226 Difference]: Without dead ends: 240 [2019-01-07 21:42:39,202 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-01-07 21:42:39,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-01-07 21:42:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2019-01-07 21:42:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-07 21:42:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1251 transitions. [2019-01-07 21:42:39,238 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1251 transitions. Word has length 5 [2019-01-07 21:42:39,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:39,239 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1251 transitions. [2019-01-07 21:42:39,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:42:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1251 transitions. [2019-01-07 21:42:39,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:39,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:39,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:39,240 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:39,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:39,240 INFO L82 PathProgramCache]: Analyzing trace with hash 29307954, now seen corresponding path program 1 times [2019-01-07 21:42:39,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:39,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:39,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:42:39,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:39,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:39,402 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-07 21:42:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:39,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:39,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:39,783 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:39,783 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [27] [2019-01-07 21:42:39,784 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:39,784 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:39,786 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:39,786 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:39,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:39,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:39,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:39,787 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-01-07 21:42:39,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:39,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:39,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:40,020 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-07 21:42:40,031 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 21 treesize of output 24 [2019-01-07 21:42:40,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, 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 30 [2019-01-07 21:42:40,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,041 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 26 treesize of output 40 [2019-01-07 21:42:40,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,048 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 28 treesize of output 54 [2019-01-07 21:42:40,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,058 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 30 treesize of output 72 [2019-01-07 21:42:40,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,068 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:42:40,068 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:40,106 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:40,128 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:40,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:40,160 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:40,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:40,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,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, 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-01-07 21:42:40,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,243 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-01-07 21:42:40,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,287 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-01-07 21:42:40,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,339 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-01-07 21:42:40,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,408 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-01-07 21:42:40,408 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:40,433 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:40,457 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:40,481 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:40,506 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:40,582 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-01-07 21:42:40,582 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-07 21:42:40,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,615 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-01-07 21:42:40,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:40,658 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-01-07 21:42:40,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-07 21:42:40,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,693 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-01-07 21:42:40,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:40,740 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-01-07 21:42:40,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-07 21:42:40,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:40,781 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:40,782 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-01-07 21:42:40,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:40,834 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-01-07 21:42:40,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-07 21:42:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:40,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:40,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:40,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:40,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:42:40,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:40,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:42:40,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:42:40,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:42:40,911 INFO L87 Difference]: Start difference. First operand 202 states and 1251 transitions. Second operand 10 states. [2019-01-07 21:42:41,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:41,504 INFO L93 Difference]: Finished difference Result 249 states and 1369 transitions. [2019-01-07 21:42:41,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:42:41,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:42:41,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:41,508 INFO L225 Difference]: With dead ends: 249 [2019-01-07 21:42:41,508 INFO L226 Difference]: Without dead ends: 247 [2019-01-07 21:42:41,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:42:41,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-07 21:42:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212. [2019-01-07 21:42:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-07 21:42:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1326 transitions. [2019-01-07 21:42:41,545 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1326 transitions. Word has length 5 [2019-01-07 21:42:41,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:41,545 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1326 transitions. [2019-01-07 21:42:41,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:42:41,545 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1326 transitions. [2019-01-07 21:42:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:41,546 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:41,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:41,546 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:41,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:41,547 INFO L82 PathProgramCache]: Analyzing trace with hash 29294624, now seen corresponding path program 1 times [2019-01-07 21:42:41,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:41,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:41,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:41,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:41,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:41,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:41,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:41,648 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:41,648 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [27] [2019-01-07 21:42:41,649 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:41,649 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:41,651 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:41,651 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:41,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:41,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:41,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:41,652 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-01-07 21:42:41,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:41,659 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:41,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:41,699 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 21 treesize of output 24 [2019-01-07 21:42:41,701 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 24 treesize of output 30 [2019-01-07 21:42:41,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,706 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 26 treesize of output 40 [2019-01-07 21:42:41,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,711 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 28 treesize of output 54 [2019-01-07 21:42:41,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,718 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 30 treesize of output 72 [2019-01-07 21:42:41,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:42:41,726 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:41,754 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:41,773 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:41,790 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:41,804 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:41,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:41,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-07 21:42:41,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,873 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 41 treesize of output 53 [2019-01-07 21:42:41,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-07 21:42:41,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:42:41,960 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:42,000 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:42,016 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:42,031 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:42,062 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-01-07 21:42:42,063 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-07 21:42:42,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,117 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:42:42,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:42,146 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-01-07 21:42:42,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-07 21:42:42,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,183 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-07 21:42:42,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:42,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:42,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-07 21:42:42,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:42,256 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:42,257 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-07 21:42:42,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:42,314 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-01-07 21:42:42,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-07 21:42:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:42,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:42,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:42,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:42:42,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:42,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:42:42,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:42:42,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:42:42,395 INFO L87 Difference]: Start difference. First operand 212 states and 1326 transitions. Second operand 10 states. [2019-01-07 21:42:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:42,969 INFO L93 Difference]: Finished difference Result 260 states and 1437 transitions. [2019-01-07 21:42:42,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:42:42,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:42:42,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:42,972 INFO L225 Difference]: With dead ends: 260 [2019-01-07 21:42:42,972 INFO L226 Difference]: Without dead ends: 258 [2019-01-07 21:42:42,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:42:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-07 21:42:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 221. [2019-01-07 21:42:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-07 21:42:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-01-07 21:42:43,014 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-01-07 21:42:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:43,014 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-01-07 21:42:43,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:42:43,014 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-01-07 21:42:43,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:43,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:43,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:43,015 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:43,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:43,015 INFO L82 PathProgramCache]: Analyzing trace with hash 29298904, now seen corresponding path program 1 times [2019-01-07 21:42:43,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:43,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:43,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:43,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:43,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:43,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:43,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:43,156 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:43,156 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [29] [2019-01-07 21:42:43,156 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:43,157 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:43,161 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:43,161 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:43,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:43,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:43,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:43,161 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-01-07 21:42:43,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:43,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:43,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:43,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:42:43,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:42:43,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,227 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 26 treesize of output 36 [2019-01-07 21:42:43,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,234 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 28 treesize of output 50 [2019-01-07 21:42:43,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:42:43,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:42:43,252 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:43,300 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:43,321 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:43,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:43,348 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:43,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:43,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:42:43,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,406 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 53 treesize of output 63 [2019-01-07 21:42:43,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:42:43,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:42:43,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-07 21:42:43,559 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:43,580 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:43,602 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:43,625 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:43,650 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:43,690 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-01-07 21:42:43,691 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-07 21:42:43,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,716 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 41 treesize of output 93 [2019-01-07 21:42:43,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:43,755 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-01-07 21:42:43,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-07 21:42:43,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:43,783 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:43,784 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 41 treesize of output 101 [2019-01-07 21:42:43,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:43,825 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-01-07 21:42:43,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:55 [2019-01-07 21:42:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:43,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:43,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:43,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:42:43,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:43,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:42:43,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:42:43,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:42:43,887 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-01-07 21:42:44,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:44,189 INFO L93 Difference]: Finished difference Result 244 states and 1417 transitions. [2019-01-07 21:42:44,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:42:44,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:42:44,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:44,192 INFO L225 Difference]: With dead ends: 244 [2019-01-07 21:42:44,193 INFO L226 Difference]: Without dead ends: 243 [2019-01-07 21:42:44,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:42:44,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-07 21:42:44,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2019-01-07 21:42:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-07 21:42:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-01-07 21:42:44,232 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-01-07 21:42:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:44,232 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-01-07 21:42:44,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:42:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-01-07 21:42:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:44,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:44,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:44,233 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:44,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:44,234 INFO L82 PathProgramCache]: Analyzing trace with hash 29366174, now seen corresponding path program 1 times [2019-01-07 21:42:44,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:44,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:44,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:44,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:44,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:44,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:44,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:44,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:44,352 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:44,352 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [28], [29] [2019-01-07 21:42:44,353 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:44,353 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:44,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:44,356 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:44,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:44,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:44,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:44,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:42:44,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:44,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:44,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:44,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:42:44,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:42:44,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-07 21:42:44,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,405 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 28 treesize of output 50 [2019-01-07 21:42:44,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:42:44,420 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-07 21:42:44,421 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,447 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,466 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,494 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-07 21:42:44,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,545 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 36 treesize of output 49 [2019-01-07 21:42:44,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-07 21:42:44,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-07 21:42:44,623 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,636 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,650 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,665 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,692 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-01-07 21:42:44,692 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-07 21:42:44,896 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-07 21:42:44,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-01-07 21:42:44,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-01-07 21:42:45,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-01-07 21:42:45,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:361 [2019-01-07 21:42:45,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,397 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:45,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 72 [2019-01-07 21:42:45,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:45,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,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, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 88 [2019-01-07 21:42:45,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:45,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:45,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 63 [2019-01-07 21:42:45,590 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:45,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-07 21:42:45,658 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:170, output treesize:126 [2019-01-07 21:42:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:45,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:45,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:45,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:42:45,778 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:45,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:42:45,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:42:45,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:42:45,778 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-01-07 21:42:46,310 WARN L181 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-07 21:42:46,617 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-01-07 21:42:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:57,199 INFO L93 Difference]: Finished difference Result 273 states and 1446 transitions. [2019-01-07 21:42:57,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:42:57,200 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:42:57,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:57,203 INFO L225 Difference]: With dead ends: 273 [2019-01-07 21:42:57,203 INFO L226 Difference]: Without dead ends: 272 [2019-01-07 21:42:57,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:42:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-07 21:42:57,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2019-01-07 21:42:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-07 21:42:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 1396 transitions. [2019-01-07 21:42:57,240 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 1396 transitions. Word has length 5 [2019-01-07 21:42:57,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:57,240 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 1396 transitions. [2019-01-07 21:42:57,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:42:57,240 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 1396 transitions. [2019-01-07 21:42:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:57,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:57,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:57,241 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:57,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:57,241 INFO L82 PathProgramCache]: Analyzing trace with hash 29353958, now seen corresponding path program 2 times [2019-01-07 21:42:57,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:57,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:57,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:57,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:57,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:57,403 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 14 [2019-01-07 21:42:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:57,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:57,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:57,419 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:42:57,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:42:57,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:57,420 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-01-07 21:42:57,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:42:57,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:42:57,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:42:57,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:42:57,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:57,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:42:57,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, 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 30 [2019-01-07 21:42:57,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,470 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 26 treesize of output 40 [2019-01-07 21:42:57,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,475 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 28 treesize of output 54 [2019-01-07 21:42:57,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,483 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 30 treesize of output 72 [2019-01-07 21:42:57,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,499 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:42:57,500 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:57,539 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:57,558 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:57,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:57,590 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:57,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:57,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,635 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-01-07 21:42:57,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,674 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-01-07 21:42:57,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,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-01-07 21:42:57,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,772 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-01-07 21:42:57,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:57,841 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-01-07 21:42:57,841 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:57,866 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:57,890 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:57,916 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:57,941 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:57,984 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-01-07 21:42:57,984 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-07 21:42:58,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,012 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-01-07 21:42:58,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:58,055 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-01-07 21:42:58,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-07 21:42:58,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,085 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:58,086 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-01-07 21:42:58,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:58,133 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-01-07 21:42:58,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-07 21:42:58,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:58,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, 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-01-07 21:42:58,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:58,220 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-01-07 21:42:58,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-07 21:42:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:58,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:58,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:58,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:42:58,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:58,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:42:58,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:42:58,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:42:58,283 INFO L87 Difference]: Start difference. First operand 222 states and 1396 transitions. Second operand 10 states. [2019-01-07 21:42:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:59,230 INFO L93 Difference]: Finished difference Result 274 states and 1519 transitions. [2019-01-07 21:42:59,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:42:59,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:42:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:59,234 INFO L225 Difference]: With dead ends: 274 [2019-01-07 21:42:59,234 INFO L226 Difference]: Without dead ends: 273 [2019-01-07 21:42:59,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:42:59,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-01-07 21:42:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 225. [2019-01-07 21:42:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-07 21:42:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-01-07 21:42:59,279 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-01-07 21:42:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:59,280 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-01-07 21:42:59,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:42:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-01-07 21:42:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:42:59,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:59,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:42:59,281 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:59,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:59,281 INFO L82 PathProgramCache]: Analyzing trace with hash 29372004, now seen corresponding path program 1 times [2019-01-07 21:42:59,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:59,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:59,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:42:59,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:59,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:59,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:59,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:59,321 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:42:59,321 INFO L207 CegarAbsIntRunner]: [0], [24], [28], [30], [31] [2019-01-07 21:42:59,322 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:59,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:59,325 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:59,325 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:42:59,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:59,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:59,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:59,326 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-01-07 21:42:59,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:59,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:59,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:59,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:42:59,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,370 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 53 treesize of output 63 [2019-01-07 21:42:59,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:42:59,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:42:59,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-07 21:42:59,528 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:59,553 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:59,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:59,599 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:59,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:59,658 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 21 treesize of output 24 [2019-01-07 21:42:59,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:42:59,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-07 21:42:59,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, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-07 21:42:59,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:42:59,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:42:59,679 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:59,717 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:59,748 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:59,762 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:59,773 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:59,784 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:59,824 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-01-07 21:42:59,824 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-01-07 21:42:59,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:59,844 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 41 treesize of output 93 [2019-01-07 21:42:59,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:59,886 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-01-07 21:42:59,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:97, output treesize:67 [2019-01-07 21:42:59,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:59,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:59,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:59,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:42:59,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:59,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:42:59,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:42:59,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:42:59,931 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 6 states. [2019-01-07 21:43:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:00,133 INFO L93 Difference]: Finished difference Result 242 states and 1433 transitions. [2019-01-07 21:43:00,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:43:00,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-07 21:43:00,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:00,137 INFO L225 Difference]: With dead ends: 242 [2019-01-07 21:43:00,137 INFO L226 Difference]: Without dead ends: 241 [2019-01-07 21:43:00,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 21:43:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-07 21:43:00,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-01-07 21:43:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-07 21:43:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-01-07 21:43:00,183 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-01-07 21:43:00,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:00,184 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-01-07 21:43:00,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:43:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-01-07 21:43:00,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:43:00,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:00,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:43:00,185 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:00,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:00,185 INFO L82 PathProgramCache]: Analyzing trace with hash 29357926, now seen corresponding path program 1 times [2019-01-07 21:43:00,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:00,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:00,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:00,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:00,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:00,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:00,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:00,301 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:43:00,302 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [27] [2019-01-07 21:43:00,302 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:00,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:00,304 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:00,305 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:43:00,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:00,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:00,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:00,305 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-01-07 21:43:00,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:00,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:00,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:00,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,343 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-01-07 21:43:00,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,379 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-01-07 21:43:00,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,424 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-01-07 21:43:00,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,478 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-01-07 21:43:00,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,548 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-01-07 21:43:00,549 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:00,575 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:00,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:00,625 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:00,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:00,683 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 21 treesize of output 24 [2019-01-07 21:43:00,686 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 24 treesize of output 30 [2019-01-07 21:43:00,689 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 26 treesize of output 40 [2019-01-07 21:43:00,691 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 28 treesize of output 54 [2019-01-07 21:43:00,693 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 30 treesize of output 72 [2019-01-07 21:43:00,695 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:43:00,695 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:00,726 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:00,745 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:00,760 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:00,773 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:00,784 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:00,827 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-01-07 21:43:00,827 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-07 21:43:00,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,860 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-01-07 21:43:00,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:00,901 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-01-07 21:43:00,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-07 21:43:00,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:00,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, 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-01-07 21:43:00,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:00,984 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-01-07 21:43:00,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-07 21:43:01,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:01,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:01,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:01,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:01,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:01,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:01,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:01,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:01,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:01,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:01,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:01,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:01,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:01,021 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:01,022 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-01-07 21:43:01,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:01,071 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-01-07 21:43:01,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-07 21:43:01,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:01,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:01,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:01,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:43:01,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:01,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:43:01,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:43:01,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:43:01,150 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 10 states. [2019-01-07 21:43:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:01,763 INFO L93 Difference]: Finished difference Result 276 states and 1527 transitions. [2019-01-07 21:43:01,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:43:01,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:43:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:01,767 INFO L225 Difference]: With dead ends: 276 [2019-01-07 21:43:01,767 INFO L226 Difference]: Without dead ends: 274 [2019-01-07 21:43:01,767 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-01-07 21:43:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-07 21:43:01,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 234. [2019-01-07 21:43:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-07 21:43:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 1480 transitions. [2019-01-07 21:43:01,817 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 1480 transitions. Word has length 5 [2019-01-07 21:43:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:01,817 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 1480 transitions. [2019-01-07 21:43:01,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:43:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 1480 transitions. [2019-01-07 21:43:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:43:01,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:01,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:43:01,818 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:01,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:01,818 INFO L82 PathProgramCache]: Analyzing trace with hash 28933724, now seen corresponding path program 1 times [2019-01-07 21:43:01,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:01,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:01,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:01,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:01,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:01,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:01,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:01,904 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:43:01,904 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [29] [2019-01-07 21:43:01,906 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:01,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:01,908 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:01,908 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:43:01,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:01,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:01,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:01,909 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-01-07 21:43:01,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:01,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:01,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:01,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:01,944 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 48 treesize of output 54 [2019-01-07 21:43:01,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:01,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:01,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 41 treesize of output 53 [2019-01-07 21:43:02,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,012 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 32 treesize of output 61 [2019-01-07 21:43:02,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:43:02,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:02,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:02,092 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:02,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:02,131 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 21 treesize of output 24 [2019-01-07 21:43:02,134 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 24 treesize of output 30 [2019-01-07 21:43:02,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:43:02,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, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:43:02,143 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 30 treesize of output 72 [2019-01-07 21:43:02,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:43:02,152 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:02,177 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:02,196 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:02,211 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:02,223 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:02,234 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:02,265 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-01-07 21:43:02,265 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-07 21:43:02,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,298 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:43:02,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:02,327 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-01-07 21:43:02,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-07 21:43:02,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:02,351 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-07 21:43:02,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:02,383 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-01-07 21:43:02,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-07 21:43:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:02,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:02,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:02,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:43:02,436 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:02,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:43:02,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:43:02,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:43:02,437 INFO L87 Difference]: Start difference. First operand 234 states and 1480 transitions. Second operand 8 states. [2019-01-07 21:43:02,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:02,810 INFO L93 Difference]: Finished difference Result 288 states and 1635 transitions. [2019-01-07 21:43:02,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:43:02,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:43:02,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:02,814 INFO L225 Difference]: With dead ends: 288 [2019-01-07 21:43:02,814 INFO L226 Difference]: Without dead ends: 287 [2019-01-07 21:43:02,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:43:02,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-07 21:43:02,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 250. [2019-01-07 21:43:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-01-07 21:43:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 1595 transitions. [2019-01-07 21:43:02,864 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 1595 transitions. Word has length 5 [2019-01-07 21:43:02,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:02,864 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 1595 transitions. [2019-01-07 21:43:02,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:43:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 1595 transitions. [2019-01-07 21:43:02,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:43:02,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:02,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:43:02,865 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:02,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:02,865 INFO L82 PathProgramCache]: Analyzing trace with hash 28941412, now seen corresponding path program 1 times [2019-01-07 21:43:02,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:02,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:02,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:02,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:02,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:03,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:03,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:03,029 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:43:03,030 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [28], [29] [2019-01-07 21:43:03,031 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:03,031 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:03,034 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:03,034 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:43:03,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:03,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:03,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:03,035 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-01-07 21:43:03,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:03,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:03,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:03,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:43:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:43:03,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,077 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 26 treesize of output 36 [2019-01-07 21:43:03,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,090 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 28 treesize of output 50 [2019-01-07 21:43:03,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:43:03,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, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-07 21:43:03,113 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:03,139 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:03,159 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:03,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:03,187 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:03,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:03,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-07 21:43:03,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,235 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 36 treesize of output 49 [2019-01-07 21:43:03,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-07 21:43:03,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-07 21:43:03,315 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:03,329 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:03,342 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:03,358 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:03,386 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-01-07 21:43:03,387 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-07 21:43:03,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:43:03,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:43:03,514 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-01-07 21:43:03,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-07 21:43:03,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:03,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-07 21:43:03,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:03,570 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-01-07 21:43:03,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:27 [2019-01-07 21:43:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:03,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:03,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:03,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:03,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 21:43:03,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:03,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:43:03,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:43:03,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:43:03,616 INFO L87 Difference]: Start difference. First operand 250 states and 1595 transitions. Second operand 8 states. [2019-01-07 21:43:04,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:04,005 INFO L93 Difference]: Finished difference Result 319 states and 1823 transitions. [2019-01-07 21:43:04,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:43:04,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:43:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:04,009 INFO L225 Difference]: With dead ends: 319 [2019-01-07 21:43:04,009 INFO L226 Difference]: Without dead ends: 318 [2019-01-07 21:43:04,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:43:04,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-01-07 21:43:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 276. [2019-01-07 21:43:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-07 21:43:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-01-07 21:43:04,063 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 5 [2019-01-07 21:43:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:04,064 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-01-07 21:43:04,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:43:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-01-07 21:43:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:04,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:04,065 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-07 21:43:04,065 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:04,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:04,065 INFO L82 PathProgramCache]: Analyzing trace with hash 904691166, now seen corresponding path program 1 times [2019-01-07 21:43:04,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:04,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:04,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:04,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:04,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:43:04,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:04,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:04,095 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:04,095 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [30], [31] [2019-01-07 21:43:04,098 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:04,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:04,100 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:04,100 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-01-07 21:43:04,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:04,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:04,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:04,100 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-01-07 21:43:04,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:04,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:04,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:04,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-07 21:43:04,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,148 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 36 treesize of output 49 [2019-01-07 21:43:04,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-07 21:43:04,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,396 INFO L303 Elim1Store]: Index analysis took 170 ms [2019-01-07 21:43:04,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-07 21:43:04,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:04,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:04,560 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:04,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:04,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:43:04,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, 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 26 [2019-01-07 21:43:04,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-07 21:43:04,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-07 21:43:04,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:43:04,632 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-07 21:43:04,633 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:04,656 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:04,674 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:04,687 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:04,698 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:04,710 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:04,737 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-01-07 21:43:04,737 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-07 21:43:04,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-07 21:43:04,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:04,814 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-01-07 21:43:04,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-07 21:43:04,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:04,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2019-01-07 21:43:04,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:04,868 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-01-07 21:43:04,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-01-07 21:43:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:04,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:04,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-01-07 21:43:04,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:04,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-07 21:43:04,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:04,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 21:43:04,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 21:43:04,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:43:04,919 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 7 states. [2019-01-07 21:43:05,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:05,132 INFO L93 Difference]: Finished difference Result 290 states and 1801 transitions. [2019-01-07 21:43:05,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:43:05,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-07 21:43:05,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:05,136 INFO L225 Difference]: With dead ends: 290 [2019-01-07 21:43:05,136 INFO L226 Difference]: Without dead ends: 289 [2019-01-07 21:43:05,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:43:05,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-07 21:43:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2019-01-07 21:43:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-07 21:43:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-01-07 21:43:05,204 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 6 [2019-01-07 21:43:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:05,204 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-01-07 21:43:05,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 21:43:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-01-07 21:43:05,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:05,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:05,206 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-07 21:43:05,206 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:05,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:05,206 INFO L82 PathProgramCache]: Analyzing trace with hash 904323688, now seen corresponding path program 3 times [2019-01-07 21:43:05,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:05,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:05,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:05,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:05,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:43:05,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:05,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:05,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:43:05,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:43:05,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:05,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:43:05,376 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:43:05,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:43:05,382 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:43:05,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:43:05,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:05,399 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 21 treesize of output 24 [2019-01-07 21:43:05,402 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 24 treesize of output 30 [2019-01-07 21:43:05,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,408 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 26 treesize of output 40 [2019-01-07 21:43:05,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,416 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 28 treesize of output 54 [2019-01-07 21:43:05,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,426 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 30 treesize of output 72 [2019-01-07 21:43:05,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:43:05,440 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:05,467 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:05,488 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:05,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:05,519 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:05,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:05,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,559 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 48 treesize of output 54 [2019-01-07 21:43:05,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-07 21:43:05,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,637 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 32 treesize of output 61 [2019-01-07 21:43:05,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:43:05,683 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:05,698 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:05,713 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:05,728 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:05,759 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-01-07 21:43:05,759 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-07 21:43:05,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,792 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:43:05,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:05,819 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-01-07 21:43:05,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-07 21:43:05,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,850 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-07 21:43:05,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:05,883 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-01-07 21:43:05,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-07 21:43:05,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-07 21:43:05,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:05,948 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-01-07 21:43:05,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-07 21:43:05,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:05,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-07 21:43:05,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:06,015 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-01-07 21:43:06,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:43:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:06,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:06,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:06,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-07 21:43:06,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:06,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:43:06,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:43:06,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:43:06,081 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 11 states. [2019-01-07 21:43:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:06,736 INFO L93 Difference]: Finished difference Result 423 states and 2543 transitions. [2019-01-07 21:43:06,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-07 21:43:06,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-07 21:43:06,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:06,741 INFO L225 Difference]: With dead ends: 423 [2019-01-07 21:43:06,741 INFO L226 Difference]: Without dead ends: 421 [2019-01-07 21:43:06,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:43:06,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-07 21:43:06,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 325. [2019-01-07 21:43:06,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-07 21:43:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 2130 transitions. [2019-01-07 21:43:06,856 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 2130 transitions. Word has length 6 [2019-01-07 21:43:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:06,856 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 2130 transitions. [2019-01-07 21:43:06,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:43:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 2130 transitions. [2019-01-07 21:43:06,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:06,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:06,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:06,858 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:06,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:06,859 INFO L82 PathProgramCache]: Analyzing trace with hash 904327844, now seen corresponding path program 1 times [2019-01-07 21:43:06,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:06,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:43:06,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:06,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:07,002 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-07 21:43:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:43:07,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:07,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:07,154 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:07,155 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [28], [29] [2019-01-07 21:43:07,156 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:07,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:07,158 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:07,158 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:43:07,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:07,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:07,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:07,159 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-01-07 21:43:07,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:07,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:07,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:07,194 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 21 treesize of output 24 [2019-01-07 21:43:07,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, 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 30 [2019-01-07 21:43:07,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,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 26 treesize of output 40 [2019-01-07 21:43:07,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,206 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 28 treesize of output 54 [2019-01-07 21:43:07,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,215 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 30 treesize of output 72 [2019-01-07 21:43:07,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,223 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:43:07,224 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:07,263 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:07,283 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:07,301 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:07,315 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:07,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:07,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,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 68 treesize of output 71 [2019-01-07 21:43:07,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,453 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-01-07 21:43:07,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,530 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-01-07 21:43:07,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,585 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-01-07 21:43:07,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,652 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-01-07 21:43:07,652 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:07,677 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:07,701 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:07,725 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:07,750 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:07,792 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-01-07 21:43:07,792 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-07 21:43:07,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,824 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-01-07 21:43:07,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:07,866 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-01-07 21:43:07,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-07 21:43:07,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,901 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-01-07 21:43:07,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:07,950 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-01-07 21:43:07,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-07 21:43:07,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:07,991 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:07,992 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-01-07 21:43:07,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:08,039 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-01-07 21:43:08,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-01-07 21:43:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:08,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:08,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:08,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:43:08,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:08,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:43:08,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:43:08,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:43:08,289 INFO L87 Difference]: Start difference. First operand 325 states and 2130 transitions. Second operand 10 states. [2019-01-07 21:43:08,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:08,904 INFO L93 Difference]: Finished difference Result 368 states and 2210 transitions. [2019-01-07 21:43:08,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:43:08,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:43:08,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:08,909 INFO L225 Difference]: With dead ends: 368 [2019-01-07 21:43:08,909 INFO L226 Difference]: Without dead ends: 366 [2019-01-07 21:43:08,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:43:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-07 21:43:08,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 329. [2019-01-07 21:43:08,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-07 21:43:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 2135 transitions. [2019-01-07 21:43:08,988 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 2135 transitions. Word has length 6 [2019-01-07 21:43:08,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:08,989 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 2135 transitions. [2019-01-07 21:43:08,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:43:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 2135 transitions. [2019-01-07 21:43:08,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:08,990 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:08,990 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-07 21:43:08,990 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:08,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:08,991 INFO L82 PathProgramCache]: Analyzing trace with hash 904329640, now seen corresponding path program 3 times [2019-01-07 21:43:08,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:08,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:08,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:08,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:08,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:43:09,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:09,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:09,067 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:43:09,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:43:09,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:09,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 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-01-07 21:43:09,077 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:43:09,077 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:43:09,081 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:43:09,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:43:09,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:09,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 21 treesize of output 24 [2019-01-07 21:43:09,110 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 24 treesize of output 30 [2019-01-07 21:43:09,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,115 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 26 treesize of output 40 [2019-01-07 21:43:09,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,157 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 28 treesize of output 54 [2019-01-07 21:43:09,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:43:09,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,208 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:43:09,209 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:09,247 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:09,269 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:09,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:09,301 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:09,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:09,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,347 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-01-07 21:43:09,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,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-01-07 21:43:09,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,429 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-01-07 21:43:09,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,483 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-01-07 21:43:09,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,552 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-01-07 21:43:09,552 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:09,577 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:09,601 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:09,625 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:09,650 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:09,692 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-01-07 21:43:09,693 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-07 21:43:09,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,719 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-01-07 21:43:09,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:09,760 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-01-07 21:43:09,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-07 21:43:09,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,794 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-01-07 21:43:09,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:09,838 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-01-07 21:43:09,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-07 21:43:09,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,871 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:09,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,872 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-01-07 21:43:09,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:09,920 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-01-07 21:43:09,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-07 21:43:09,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:09,961 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 45 treesize of output 135 [2019-01-07 21:43:09,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:10,015 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-01-07 21:43:10,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:45 [2019-01-07 21:43:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:10,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:10,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:10,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-07 21:43:10,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:10,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:43:10,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:43:10,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:43:10,098 INFO L87 Difference]: Start difference. First operand 329 states and 2135 transitions. Second operand 11 states. [2019-01-07 21:43:10,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:10,835 INFO L93 Difference]: Finished difference Result 407 states and 2353 transitions. [2019-01-07 21:43:10,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:43:10,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-07 21:43:10,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:10,841 INFO L225 Difference]: With dead ends: 407 [2019-01-07 21:43:10,841 INFO L226 Difference]: Without dead ends: 401 [2019-01-07 21:43:10,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:43:10,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-01-07 21:43:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 341. [2019-01-07 21:43:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-07 21:43:10,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 2222 transitions. [2019-01-07 21:43:10,926 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 2222 transitions. Word has length 6 [2019-01-07 21:43:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:10,927 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 2222 transitions. [2019-01-07 21:43:10,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:43:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 2222 transitions. [2019-01-07 21:43:10,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:10,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:10,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:10,928 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:10,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:10,928 INFO L82 PathProgramCache]: Analyzing trace with hash 904329206, now seen corresponding path program 1 times [2019-01-07 21:43:10,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:10,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:10,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:43:10,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:10,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:11,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:11,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:11,111 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:11,111 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [27] [2019-01-07 21:43:11,112 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:11,113 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:11,114 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:11,114 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:43:11,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:11,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:11,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:11,115 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-01-07 21:43:11,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:11,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:11,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:11,149 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 21 treesize of output 24 [2019-01-07 21:43:11,152 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 24 treesize of output 30 [2019-01-07 21:43:11,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,158 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 26 treesize of output 40 [2019-01-07 21:43:11,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,216 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 28 treesize of output 54 [2019-01-07 21:43:11,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,223 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 30 treesize of output 72 [2019-01-07 21:43:11,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,231 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:43:11,231 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:11,270 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:11,291 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:11,309 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:11,323 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:11,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:11,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,367 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-01-07 21:43:11,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,406 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-01-07 21:43:11,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,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, 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-01-07 21:43:11,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,514 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-01-07 21:43:11,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,591 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-01-07 21:43:11,592 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:11,619 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:11,643 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:11,671 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:11,715 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:11,755 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-01-07 21:43:11,756 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-07 21:43:11,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,792 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-01-07 21:43:11,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:11,832 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-01-07 21:43:11,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-07 21:43:11,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,869 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-01-07 21:43:11,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:11,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:43:11,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-07 21:43:11,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,956 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:11,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:11,958 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-01-07 21:43:11,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:12,010 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-01-07 21:43:12,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-07 21:43:12,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:12,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:12,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:12,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:12,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:12,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:12,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:12,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:12,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:12,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:12,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:12,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:12,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:12,048 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:12,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:12,050 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-01-07 21:43:12,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:12,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-01-07 21:43:12,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-07 21:43:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:12,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:12,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:12,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-07 21:43:12,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:12,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:43:12,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:43:12,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:43:12,192 INFO L87 Difference]: Start difference. First operand 341 states and 2222 transitions. Second operand 12 states. [2019-01-07 21:43:13,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:13,222 INFO L93 Difference]: Finished difference Result 645 states and 3901 transitions. [2019-01-07 21:43:13,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-07 21:43:13,223 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:43:13,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:13,230 INFO L225 Difference]: With dead ends: 645 [2019-01-07 21:43:13,230 INFO L226 Difference]: Without dead ends: 643 [2019-01-07 21:43:13,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-07 21:43:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-01-07 21:43:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 463. [2019-01-07 21:43:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-01-07 21:43:13,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 3101 transitions. [2019-01-07 21:43:13,350 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 3101 transitions. Word has length 6 [2019-01-07 21:43:13,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:13,351 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 3101 transitions. [2019-01-07 21:43:13,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:43:13,351 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 3101 transitions. [2019-01-07 21:43:13,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:13,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:13,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:13,352 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:13,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:13,353 INFO L82 PathProgramCache]: Analyzing trace with hash 904333674, now seen corresponding path program 1 times [2019-01-07 21:43:13,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:13,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:13,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:13,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:13,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:13,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:13,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:13,438 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:13,438 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [30], [31] [2019-01-07 21:43:13,439 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:13,439 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:13,441 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:13,441 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:43:13,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:13,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:13,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:13,441 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-01-07 21:43:13,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:13,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:13,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:13,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:43:13,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:43:13,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,479 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 26 treesize of output 36 [2019-01-07 21:43:13,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,485 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 28 treesize of output 50 [2019-01-07 21:43:13,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:43:13,504 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-07 21:43:13,504 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:13,530 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:13,549 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:13,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:13,575 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:13,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:13,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-07 21:43:13,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,625 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 36 treesize of output 49 [2019-01-07 21:43:13,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-07 21:43:13,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-07 21:43:13,703 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:13,717 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:13,730 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:13,745 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:13,773 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-01-07 21:43:13,773 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-07 21:43:13,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-07 21:43:13,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:13,895 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-01-07 21:43:13,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-07 21:43:13,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:13,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-07 21:43:13,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:43:14,024 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-01-07 21:43:14,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:68 [2019-01-07 21:43:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:14,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:14,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:14,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:14,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-07 21:43:14,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:14,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:43:14,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:43:14,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:43:14,100 INFO L87 Difference]: Start difference. First operand 463 states and 3101 transitions. Second operand 9 states. [2019-01-07 21:43:14,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:14,639 INFO L93 Difference]: Finished difference Result 527 states and 3325 transitions. [2019-01-07 21:43:14,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:43:14,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-07 21:43:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:14,646 INFO L225 Difference]: With dead ends: 527 [2019-01-07 21:43:14,646 INFO L226 Difference]: Without dead ends: 524 [2019-01-07 21:43:14,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:43:14,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-01-07 21:43:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 487. [2019-01-07 21:43:14,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-07 21:43:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 3268 transitions. [2019-01-07 21:43:14,773 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 3268 transitions. Word has length 6 [2019-01-07 21:43:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:14,773 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 3268 transitions. [2019-01-07 21:43:14,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:43:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 3268 transitions. [2019-01-07 21:43:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:14,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:14,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:14,774 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:14,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:14,775 INFO L82 PathProgramCache]: Analyzing trace with hash 904320156, now seen corresponding path program 1 times [2019-01-07 21:43:14,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:14,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:14,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:14,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:14,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:43:14,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:14,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:14,849 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:14,849 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [28], [29] [2019-01-07 21:43:14,851 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:14,851 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:14,853 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:14,854 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:43:14,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:14,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:14,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:14,854 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-01-07 21:43:14,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:14,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:14,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:14,889 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 21 treesize of output 24 [2019-01-07 21:43:14,891 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 24 treesize of output 30 [2019-01-07 21:43:14,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:14,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:14,896 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 26 treesize of output 40 [2019-01-07 21:43:14,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:14,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:14,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:14,903 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 28 treesize of output 54 [2019-01-07 21:43:14,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:14,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:14,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:14,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:14,919 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 30 treesize of output 72 [2019-01-07 21:43:14,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:43:14,930 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:14,961 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:14,982 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:14,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:15,012 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:15,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:15,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,053 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 48 treesize of output 54 [2019-01-07 21:43:15,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,081 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 41 treesize of output 53 [2019-01-07 21:43:15,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-07 21:43:15,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:43:15,166 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:15,181 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:15,196 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:15,211 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:15,241 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-01-07 21:43:15,241 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-07 21:43:15,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,288 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:43:15,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:15,313 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-01-07 21:43:15,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-07 21:43:15,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,346 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-07 21:43:15,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:15,378 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-01-07 21:43:15,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-07 21:43:15,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:15,414 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:15,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-07 21:43:15,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:15,451 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-01-07 21:43:15,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-07 21:43:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:15,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:15,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:15,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:43:15,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:15,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:43:15,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:43:15,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:43:15,541 INFO L87 Difference]: Start difference. First operand 487 states and 3268 transitions. Second operand 10 states. [2019-01-07 21:43:16,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:16,139 INFO L93 Difference]: Finished difference Result 534 states and 3436 transitions. [2019-01-07 21:43:16,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:43:16,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:43:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:16,146 INFO L225 Difference]: With dead ends: 534 [2019-01-07 21:43:16,146 INFO L226 Difference]: Without dead ends: 533 [2019-01-07 21:43:16,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:43:16,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-01-07 21:43:16,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 505. [2019-01-07 21:43:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-01-07 21:43:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 3394 transitions. [2019-01-07 21:43:16,289 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 3394 transitions. Word has length 6 [2019-01-07 21:43:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:16,289 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 3394 transitions. [2019-01-07 21:43:16,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:43:16,289 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 3394 transitions. [2019-01-07 21:43:16,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:16,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:16,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:16,291 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:16,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:16,291 INFO L82 PathProgramCache]: Analyzing trace with hash 904806422, now seen corresponding path program 1 times [2019-01-07 21:43:16,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:16,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:16,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:16,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:16,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:16,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:16,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:16,439 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:16,439 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [28], [29] [2019-01-07 21:43:16,439 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:16,439 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:16,441 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:16,442 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:43:16,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:16,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:16,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:16,443 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-01-07 21:43:16,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:16,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:16,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:16,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:43:16,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:43:16,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,471 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 26 treesize of output 36 [2019-01-07 21:43:16,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,480 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 28 treesize of output 50 [2019-01-07 21:43:16,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,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, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:43:16,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:43:16,500 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:16,536 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:16,556 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:16,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:16,584 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:16,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:16,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:43:16,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,640 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 53 treesize of output 63 [2019-01-07 21:43:16,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:43:16,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:43:16,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-07 21:43:16,794 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:16,817 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:16,838 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:16,861 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:16,886 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:16,926 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-01-07 21:43:16,926 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-07 21:43:16,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:16,993 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 41 treesize of output 87 [2019-01-07 21:43:16,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:17,049 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-01-07 21:43:17,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-07 21:43:17,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 101 [2019-01-07 21:43:17,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:17,125 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-01-07 21:43:17,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-07 21:43:17,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,161 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:17,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:17,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, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 114 [2019-01-07 21:43:17,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:17,207 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-01-07 21:43:17,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-01-07 21:43:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:17,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:17,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:17,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:43:17,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:17,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:43:17,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:43:17,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:43:17,287 INFO L87 Difference]: Start difference. First operand 505 states and 3394 transitions. Second operand 10 states. [2019-01-07 21:43:17,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:17,874 INFO L93 Difference]: Finished difference Result 543 states and 3439 transitions. [2019-01-07 21:43:17,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:43:17,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:43:17,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:17,880 INFO L225 Difference]: With dead ends: 543 [2019-01-07 21:43:17,881 INFO L226 Difference]: Without dead ends: 542 [2019-01-07 21:43:17,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:43:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-01-07 21:43:18,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 500. [2019-01-07 21:43:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-07 21:43:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3359 transitions. [2019-01-07 21:43:18,017 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3359 transitions. Word has length 6 [2019-01-07 21:43:18,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:18,018 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3359 transitions. [2019-01-07 21:43:18,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:43:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3359 transitions. [2019-01-07 21:43:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:18,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:18,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:18,020 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:18,020 INFO L82 PathProgramCache]: Analyzing trace with hash 904796812, now seen corresponding path program 1 times [2019-01-07 21:43:18,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:18,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:18,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:18,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:18,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:18,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:18,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:18,102 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:18,102 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [28], [29] [2019-01-07 21:43:18,104 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:18,104 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:18,106 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:18,106 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:43:18,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:18,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:18,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:18,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:43:18,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:18,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:18,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:18,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:43:18,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:43:18,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,139 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 26 treesize of output 36 [2019-01-07 21:43:18,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-07 21:43:18,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:43:18,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:43:18,172 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:18,209 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:18,228 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:18,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:18,257 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:18,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:18,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:43:18,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,314 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 53 treesize of output 63 [2019-01-07 21:43:18,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:43:18,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:43:18,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-07 21:43:18,473 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:18,496 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:18,519 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:18,541 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:18,566 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:18,607 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-01-07 21:43:18,607 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-07 21:43:18,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,639 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 41 treesize of output 87 [2019-01-07 21:43:18,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:18,678 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-01-07 21:43:18,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-07 21:43:18,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 101 [2019-01-07 21:43:18,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:18,754 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-01-07 21:43:18,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-07 21:43:18,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:18,795 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:18,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 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-01-07 21:43:18,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:18,841 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-01-07 21:43:18,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-01-07 21:43:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:18,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:18,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:18,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:43:18,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:18,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:43:18,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:43:18,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:43:18,923 INFO L87 Difference]: Start difference. First operand 500 states and 3359 transitions. Second operand 10 states. [2019-01-07 21:43:21,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:21,560 INFO L93 Difference]: Finished difference Result 537 states and 3427 transitions. [2019-01-07 21:43:21,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:43:21,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:43:21,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:21,565 INFO L225 Difference]: With dead ends: 537 [2019-01-07 21:43:21,565 INFO L226 Difference]: Without dead ends: 536 [2019-01-07 21:43:21,566 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-01-07 21:43:21,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-01-07 21:43:21,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 501. [2019-01-07 21:43:21,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-01-07 21:43:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 3366 transitions. [2019-01-07 21:43:21,698 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 3366 transitions. Word has length 6 [2019-01-07 21:43:21,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:21,698 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 3366 transitions. [2019-01-07 21:43:21,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:43:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 3366 transitions. [2019-01-07 21:43:21,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:21,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:21,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:21,699 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:21,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:21,699 INFO L82 PathProgramCache]: Analyzing trace with hash 904848706, now seen corresponding path program 1 times [2019-01-07 21:43:21,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:21,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:21,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:21,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:21,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:22,106 WARN L181 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-07 21:43:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:43:22,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:22,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:22,176 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:22,176 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [29] [2019-01-07 21:43:22,178 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:22,178 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:22,180 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:22,180 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:43:22,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:22,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:22,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:22,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:43:22,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:22,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:22,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:22,313 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 21 treesize of output 24 [2019-01-07 21:43:22,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, 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 30 [2019-01-07 21:43:22,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,320 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 26 treesize of output 40 [2019-01-07 21:43:22,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,327 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 28 treesize of output 54 [2019-01-07 21:43:22,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,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 30 treesize of output 72 [2019-01-07 21:43:22,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,344 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:43:22,344 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:22,382 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:22,404 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:22,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:22,435 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:22,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:22,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,480 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-01-07 21:43:22,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,517 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-01-07 21:43:22,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,562 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-01-07 21:43:22,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,618 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-01-07 21:43:22,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,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-01-07 21:43:22,687 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:22,712 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:22,736 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:22,760 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:22,785 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:22,828 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-01-07 21:43:22,828 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-07 21:43:22,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,901 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-01-07 21:43:22,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:22,941 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-01-07 21:43:22,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-07 21:43:22,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:22,976 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:22,976 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-01-07 21:43:22,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:23,021 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-01-07 21:43:23,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-01-07 21:43:23,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:23,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:23,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:23,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:23,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:23,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:23,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:23,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:23,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:23,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:23,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:23,057 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-01-07 21:43:23,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:23,104 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-01-07 21:43:23,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-07 21:43:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:23,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:23,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:23,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:43:23,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:23,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:43:23,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:43:23,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:43:23,186 INFO L87 Difference]: Start difference. First operand 501 states and 3366 transitions. Second operand 10 states. [2019-01-07 21:43:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:23,884 INFO L93 Difference]: Finished difference Result 588 states and 3737 transitions. [2019-01-07 21:43:23,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:43:23,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:43:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:23,889 INFO L225 Difference]: With dead ends: 588 [2019-01-07 21:43:23,889 INFO L226 Difference]: Without dead ends: 587 [2019-01-07 21:43:23,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:43:23,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-01-07 21:43:24,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 534. [2019-01-07 21:43:24,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-01-07 21:43:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 3605 transitions. [2019-01-07 21:43:24,031 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 3605 transitions. Word has length 6 [2019-01-07 21:43:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:24,031 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 3605 transitions. [2019-01-07 21:43:24,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:43:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 3605 transitions. [2019-01-07 21:43:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:24,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:24,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:24,033 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:24,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:24,033 INFO L82 PathProgramCache]: Analyzing trace with hash 904869912, now seen corresponding path program 1 times [2019-01-07 21:43:24,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:24,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:24,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:24,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:24,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:24,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:24,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:24,079 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:24,079 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [28], [30], [31] [2019-01-07 21:43:24,080 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:24,080 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:24,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:24,083 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:43:24,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:24,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:24,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:24,083 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-01-07 21:43:24,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:24,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:24,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:43:24,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:43:24,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,117 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 26 treesize of output 36 [2019-01-07 21:43:24,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-07 21:43:24,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:43:24,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:43:24,145 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:24,181 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:24,202 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:24,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:24,231 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:24,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:24,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:43:24,434 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-07 21:43:24,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,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 53 treesize of output 63 [2019-01-07 21:43:24,663 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-01-07 21:43:24,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:43:24,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:43:24,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-07 21:43:24,791 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:24,817 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:24,842 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:24,866 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:24,914 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:24,954 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-01-07 21:43:24,954 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-07 21:43:24,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:24,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, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-07 21:43:24,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:25,019 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-01-07 21:43:25,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-07 21:43:25,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,047 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:25,048 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 43 treesize of output 102 [2019-01-07 21:43:25,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:25,091 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-01-07 21:43:25,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:55 [2019-01-07 21:43:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:25,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:25,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:25,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:43:25,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:25,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:43:25,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:43:25,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:43:25,152 INFO L87 Difference]: Start difference. First operand 534 states and 3605 transitions. Second operand 8 states. [2019-01-07 21:43:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:25,635 INFO L93 Difference]: Finished difference Result 558 states and 3635 transitions. [2019-01-07 21:43:25,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:43:25,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-07 21:43:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:25,639 INFO L225 Difference]: With dead ends: 558 [2019-01-07 21:43:25,639 INFO L226 Difference]: Without dead ends: 557 [2019-01-07 21:43:25,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:43:25,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-01-07 21:43:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 533. [2019-01-07 21:43:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-01-07 21:43:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 3598 transitions. [2019-01-07 21:43:25,780 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 3598 transitions. Word has length 6 [2019-01-07 21:43:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:25,780 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 3598 transitions. [2019-01-07 21:43:25,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:43:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 3598 transitions. [2019-01-07 21:43:25,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:25,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:25,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:25,781 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:25,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:25,782 INFO L82 PathProgramCache]: Analyzing trace with hash 904431632, now seen corresponding path program 1 times [2019-01-07 21:43:25,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:25,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:25,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:25,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:25,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:25,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:25,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:25,863 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:25,863 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [29] [2019-01-07 21:43:25,864 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:25,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:25,866 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:25,867 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:43:25,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:25,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:25,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:25,867 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-01-07 21:43:25,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:25,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:25,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:25,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,906 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 48 treesize of output 54 [2019-01-07 21:43:25,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,938 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 41 treesize of output 53 [2019-01-07 21:43:25,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,971 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 32 treesize of output 61 [2019-01-07 21:43:26,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:43:26,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,033 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,049 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,087 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 21 treesize of output 24 [2019-01-07 21:43:26,090 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 24 treesize of output 30 [2019-01-07 21:43:26,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:43:26,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:43:26,095 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 30 treesize of output 72 [2019-01-07 21:43:26,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:43:26,102 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,124 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,143 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,158 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,171 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,182 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,212 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-01-07 21:43:26,213 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-07 21:43:26,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,250 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:43:26,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,276 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-01-07 21:43:26,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-07 21:43:26,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,302 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:26,303 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-07 21:43:26,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,331 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-01-07 21:43:26,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-07 21:43:26,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-07 21:43:26,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,390 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-01-07 21:43:26,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-07 21:43:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:26,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:26,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:26,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:26,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:43:26,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:26,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:43:26,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:43:26,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:43:26,455 INFO L87 Difference]: Start difference. First operand 533 states and 3598 transitions. Second operand 10 states. [2019-01-07 21:43:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:27,139 INFO L93 Difference]: Finished difference Result 795 states and 5176 transitions. [2019-01-07 21:43:27,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:43:27,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:43:27,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:27,143 INFO L225 Difference]: With dead ends: 795 [2019-01-07 21:43:27,143 INFO L226 Difference]: Without dead ends: 794 [2019-01-07 21:43:27,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:43:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-01-07 21:43:27,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 484. [2019-01-07 21:43:27,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-01-07 21:43:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 3230 transitions. [2019-01-07 21:43:27,310 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 3230 transitions. Word has length 6 [2019-01-07 21:43:27,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:27,310 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 3230 transitions. [2019-01-07 21:43:27,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:43:27,310 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 3230 transitions. [2019-01-07 21:43:27,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:27,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:27,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:27,312 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:27,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:27,312 INFO L82 PathProgramCache]: Analyzing trace with hash 904452838, now seen corresponding path program 1 times [2019-01-07 21:43:27,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:27,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:27,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:27,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:27,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:27,468 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-07 21:43:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:27,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:27,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:27,510 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:27,510 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [30], [31] [2019-01-07 21:43:27,511 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:27,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:27,514 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:27,514 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:43:27,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:27,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:27,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:27,515 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-01-07 21:43:27,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:27,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:27,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:43:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:43:27,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,558 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 26 treesize of output 36 [2019-01-07 21:43:27,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,565 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 28 treesize of output 50 [2019-01-07 21:43:27,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:43:27,585 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-07 21:43:27,585 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:27,611 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:27,629 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:27,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:27,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:27,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:27,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-07 21:43:27,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,707 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 36 treesize of output 49 [2019-01-07 21:43:27,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-07 21:43:27,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-07 21:43:27,784 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:27,798 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:27,811 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:27,827 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:27,855 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-01-07 21:43:27,855 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-07 21:43:27,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-07 21:43:27,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:27,921 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-01-07 21:43:27,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-07 21:43:27,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:27,950 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:27,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 81 [2019-01-07 21:43:27,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:43:28,045 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-01-07 21:43:28,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:76 [2019-01-07 21:43:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:28,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:28,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:28,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-07 21:43:28,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:28,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:43:28,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:43:28,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:43:28,135 INFO L87 Difference]: Start difference. First operand 484 states and 3230 transitions. Second operand 9 states. [2019-01-07 21:43:28,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:28,902 INFO L93 Difference]: Finished difference Result 539 states and 3425 transitions. [2019-01-07 21:43:28,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:43:28,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-07 21:43:28,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:28,905 INFO L225 Difference]: With dead ends: 539 [2019-01-07 21:43:28,905 INFO L226 Difference]: Without dead ends: 538 [2019-01-07 21:43:28,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:43:28,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-01-07 21:43:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 500. [2019-01-07 21:43:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-07 21:43:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3342 transitions. [2019-01-07 21:43:29,133 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3342 transitions. Word has length 6 [2019-01-07 21:43:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:29,133 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3342 transitions. [2019-01-07 21:43:29,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:43:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3342 transitions. [2019-01-07 21:43:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:29,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:29,134 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-07 21:43:29,135 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:29,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:29,135 INFO L82 PathProgramCache]: Analyzing trace with hash 893599114, now seen corresponding path program 4 times [2019-01-07 21:43:29,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:29,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:29,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:29,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:29,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:43:29,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:29,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:29,234 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:43:29,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:43:29,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:29,235 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-01-07 21:43:29,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:29,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:29,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:29,269 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 21 treesize of output 24 [2019-01-07 21:43:29,271 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 24 treesize of output 30 [2019-01-07 21:43:29,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,276 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 26 treesize of output 40 [2019-01-07 21:43:29,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,282 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 28 treesize of output 54 [2019-01-07 21:43:29,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:43:29,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:43:29,298 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:29,324 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:29,344 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:29,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:29,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:29,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:29,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,415 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 48 treesize of output 54 [2019-01-07 21:43:29,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-07 21:43:29,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,501 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 32 treesize of output 61 [2019-01-07 21:43:29,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:43:29,573 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:29,589 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:29,604 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:29,619 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:29,650 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-01-07 21:43:29,650 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-07 21:43:29,896 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-07 21:43:29,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:29,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-07 21:43:29,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:43:30,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-01-07 21:43:30,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-01-07 21:43:30,256 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-07 21:43:30,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,269 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 81 [2019-01-07 21:43:30,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:30,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,361 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 2 case distinctions, treesize of input 65 treesize of output 91 [2019-01-07 21:43:30,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-07 21:43:30,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-07 21:43:30,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:129, output treesize:126 [2019-01-07 21:43:30,731 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-07 21:43:30,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,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, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 101 [2019-01-07 21:43:30,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:30,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,866 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 55 treesize of output 111 [2019-01-07 21:43:30,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:30,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:30,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-07 21:43:30,965 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:31,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-07 21:43:31,044 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:159, output treesize:123 [2019-01-07 21:43:31,261 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-07 21:43:31,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,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, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 125 [2019-01-07 21:43:31,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-07 21:43:31,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-07 21:43:31,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:31,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,776 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:31,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:31,778 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-07 21:43:31,778 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:31,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-07 21:43:31,902 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:238 [2019-01-07 21:43:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:32,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:32,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:32,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-07 21:43:32,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:32,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:43:32,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:43:32,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:43:32,122 INFO L87 Difference]: Start difference. First operand 500 states and 3342 transitions. Second operand 11 states. [2019-01-07 21:43:32,396 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-07 21:43:33,054 WARN L181 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-01-07 21:43:33,496 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-01-07 21:43:34,011 WARN L181 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-01-07 21:43:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:34,806 INFO L93 Difference]: Finished difference Result 678 states and 4253 transitions. [2019-01-07 21:43:34,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:43:34,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-07 21:43:34,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:34,811 INFO L225 Difference]: With dead ends: 678 [2019-01-07 21:43:34,811 INFO L226 Difference]: Without dead ends: 673 [2019-01-07 21:43:34,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-01-07 21:43:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-01-07 21:43:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 555. [2019-01-07 21:43:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-01-07 21:43:35,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 3727 transitions. [2019-01-07 21:43:35,023 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 3727 transitions. Word has length 6 [2019-01-07 21:43:35,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:35,023 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 3727 transitions. [2019-01-07 21:43:35,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:43:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 3727 transitions. [2019-01-07 21:43:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:35,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:35,024 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-07 21:43:35,024 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:35,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:35,025 INFO L82 PathProgramCache]: Analyzing trace with hash 893598680, now seen corresponding path program 2 times [2019-01-07 21:43:35,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:35,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:35,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:35,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:35,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:43:35,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:35,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:35,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:43:35,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:43:35,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:35,183 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-01-07 21:43:35,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:43:35,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:43:35,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:43:35,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:43:35,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:35,222 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 21 treesize of output 24 [2019-01-07 21:43:35,224 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 24 treesize of output 30 [2019-01-07 21:43:35,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,229 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 26 treesize of output 40 [2019-01-07 21:43:35,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:43:35,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,244 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 30 treesize of output 72 [2019-01-07 21:43:35,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,254 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:43:35,255 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:35,294 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:35,316 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:35,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:35,348 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:35,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:35,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,392 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-01-07 21:43:35,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,428 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-01-07 21:43:35,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,471 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-01-07 21:43:35,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,524 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-01-07 21:43:35,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,591 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-01-07 21:43:35,592 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:35,616 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:35,640 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:35,665 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:35,688 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:35,731 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-01-07 21:43:35,732 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-07 21:43:35,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,765 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-01-07 21:43:35,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:35,810 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-01-07 21:43:35,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-07 21:43:35,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,910 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-01-07 21:43:35,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:35,954 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-01-07 21:43:35,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-07 21:43:35,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:35,990 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 43 treesize of output 123 [2019-01-07 21:43:35,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:36,040 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-01-07 21:43:36,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:55 [2019-01-07 21:43:36,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:36,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:36,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:36,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:36,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:36,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:36,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:36,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:36,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:36,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:36,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:36,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:36,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:36,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:36,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:36,087 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 43 treesize of output 135 [2019-01-07 21:43:36,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:36,140 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-01-07 21:43:36,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:45 [2019-01-07 21:43:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:36,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:36,213 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:36,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:36,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-07 21:43:36,232 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:36,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:43:36,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:43:36,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:43:36,233 INFO L87 Difference]: Start difference. First operand 555 states and 3727 transitions. Second operand 11 states. [2019-01-07 21:43:37,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:37,045 INFO L93 Difference]: Finished difference Result 704 states and 4501 transitions. [2019-01-07 21:43:37,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:43:37,046 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-07 21:43:37,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:37,051 INFO L225 Difference]: With dead ends: 704 [2019-01-07 21:43:37,051 INFO L226 Difference]: Without dead ends: 703 [2019-01-07 21:43:37,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:43:37,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-01-07 21:43:37,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 655. [2019-01-07 21:43:37,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-01-07 21:43:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 4427 transitions. [2019-01-07 21:43:37,300 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 4427 transitions. Word has length 6 [2019-01-07 21:43:37,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:37,300 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 4427 transitions. [2019-01-07 21:43:37,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:43:37,300 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 4427 transitions. [2019-01-07 21:43:37,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:37,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:37,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:37,301 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:37,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:37,302 INFO L82 PathProgramCache]: Analyzing trace with hash 893604446, now seen corresponding path program 2 times [2019-01-07 21:43:37,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:37,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:37,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:43:37,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:37,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:37,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:37,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:37,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:43:37,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:43:37,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:37,468 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-01-07 21:43:37,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:43:37,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:43:37,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:43:37,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:43:37,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:37,505 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 21 treesize of output 24 [2019-01-07 21:43:37,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 30 [2019-01-07 21:43:37,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:43:37,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,535 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 28 treesize of output 54 [2019-01-07 21:43:37,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,542 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 30 treesize of output 72 [2019-01-07 21:43:37,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:43:37,551 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:37,588 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:37,609 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:37,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:37,640 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:37,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:37,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,684 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-01-07 21:43:37,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,721 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-01-07 21:43:37,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,763 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-01-07 21:43:37,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,818 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-01-07 21:43:37,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:37,885 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-01-07 21:43:37,886 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:37,912 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:37,938 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:37,963 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:37,990 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:38,040 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-01-07 21:43:38,040 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-07 21:43:38,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,079 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-01-07 21:43:38,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:38,146 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-01-07 21:43:38,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-07 21:43:38,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,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 41 treesize of output 103 [2019-01-07 21:43:38,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:38,227 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-01-07 21:43:38,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-07 21:43:38,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,267 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:38,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,269 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-01-07 21:43:38,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:38,318 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-01-07 21:43:38,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-07 21:43:38,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,356 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:38,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:38,358 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-01-07 21:43:38,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:38,407 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-01-07 21:43:38,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-07 21:43:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:38,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:38,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:38,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-07 21:43:38,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:38,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:43:38,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:43:38,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:43:38,505 INFO L87 Difference]: Start difference. First operand 655 states and 4427 transitions. Second operand 12 states. [2019-01-07 21:43:39,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:39,836 INFO L93 Difference]: Finished difference Result 1218 states and 7896 transitions. [2019-01-07 21:43:39,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-07 21:43:39,837 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:43:39,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:39,844 INFO L225 Difference]: With dead ends: 1218 [2019-01-07 21:43:39,844 INFO L226 Difference]: Without dead ends: 1217 [2019-01-07 21:43:39,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:43:39,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-01-07 21:43:40,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 738. [2019-01-07 21:43:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-01-07 21:43:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 5008 transitions. [2019-01-07 21:43:40,189 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 5008 transitions. Word has length 6 [2019-01-07 21:43:40,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:40,189 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 5008 transitions. [2019-01-07 21:43:40,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:43:40,189 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 5008 transitions. [2019-01-07 21:43:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:40,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:40,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:40,190 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:40,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:40,191 INFO L82 PathProgramCache]: Analyzing trace with hash 893724170, now seen corresponding path program 1 times [2019-01-07 21:43:40,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:40,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:40,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:43:40,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:40,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:40,342 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-07 21:43:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:43:40,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:40,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:40,374 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:40,374 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [29] [2019-01-07 21:43:40,375 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:40,375 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:40,377 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:40,377 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:43:40,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:40,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:40,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:40,378 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-01-07 21:43:40,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:40,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:40,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:40,433 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 21 treesize of output 24 [2019-01-07 21:43:40,435 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 24 treesize of output 30 [2019-01-07 21:43:40,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,440 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 26 treesize of output 40 [2019-01-07 21:43:40,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,445 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 28 treesize of output 54 [2019-01-07 21:43:40,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,452 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 30 treesize of output 72 [2019-01-07 21:43:40,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,462 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:43:40,463 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:40,499 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:40,519 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:40,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:40,548 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:40,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:40,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,594 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-01-07 21:43:40,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,632 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-01-07 21:43:40,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,674 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-01-07 21:43:40,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,729 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-01-07 21:43:40,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,798 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-01-07 21:43:40,798 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:40,823 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:40,846 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:40,870 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:40,893 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:40,935 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-01-07 21:43:40,935 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-07 21:43:40,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:40,970 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-01-07 21:43:40,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:41,011 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-01-07 21:43:41,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-07 21:43:41,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,047 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:41,048 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-01-07 21:43:41,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:41,091 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-01-07 21:43:41,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:59 [2019-01-07 21:43:41,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:41,126 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-01-07 21:43:41,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:41,172 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-01-07 21:43:41,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:47 [2019-01-07 21:43:41,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-01-07 21:43:41,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:41,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:41,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:43:41,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:41,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:43:41,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:43:41,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:43:41,255 INFO L87 Difference]: Start difference. First operand 738 states and 5008 transitions. Second operand 10 states. [2019-01-07 21:43:42,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:42,071 INFO L93 Difference]: Finished difference Result 814 states and 5311 transitions. [2019-01-07 21:43:42,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:43:42,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:43:42,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:42,076 INFO L225 Difference]: With dead ends: 814 [2019-01-07 21:43:42,076 INFO L226 Difference]: Without dead ends: 811 [2019-01-07 21:43:42,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:43:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-01-07 21:43:42,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 775. [2019-01-07 21:43:42,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-01-07 21:43:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 5267 transitions. [2019-01-07 21:43:42,434 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 5267 transitions. Word has length 6 [2019-01-07 21:43:42,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:42,434 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 5267 transitions. [2019-01-07 21:43:42,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:43:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 5267 transitions. [2019-01-07 21:43:42,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:42,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:42,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:42,435 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:42,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:42,436 INFO L82 PathProgramCache]: Analyzing trace with hash 893714560, now seen corresponding path program 1 times [2019-01-07 21:43:42,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:42,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:42,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:42,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:42,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:43:42,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:42,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:42,515 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:42,515 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [28], [29] [2019-01-07 21:43:42,515 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:42,516 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:42,518 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:42,518 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:43:42,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:42,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:42,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:42,518 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-01-07 21:43:42,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:42,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:42,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:42,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:42,556 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 48 treesize of output 54 [2019-01-07 21:43:42,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:42,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:42,588 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 41 treesize of output 53 [2019-01-07 21:43:42,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:42,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:42,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:42,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:42,623 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 32 treesize of output 61 [2019-01-07 21:43:42,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:42,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:42,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:42,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:42,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:42,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:42,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:43:42,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:42,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:42,703 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:42,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:42,741 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 21 treesize of output 24 [2019-01-07 21:43:42,744 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 24 treesize of output 30 [2019-01-07 21:43:42,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:43:42,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:43:42,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:43:42,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:43:42,760 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:42,786 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:42,804 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:42,819 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:42,831 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:42,843 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:42,873 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-01-07 21:43:42,873 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-07 21:43:42,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:42,925 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:43:42,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:42,977 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-01-07 21:43:42,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-07 21:43:43,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:43,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:43,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:43,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:43,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:43,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:43,008 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:43,009 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-07 21:43:43,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:43,039 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-01-07 21:43:43,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-07 21:43:43,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:43,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:43,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:43,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:43,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:43,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:43,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:43,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:43,081 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:43,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-07 21:43:43,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:43,112 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-01-07 21:43:43,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:43:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:43,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:43,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:43,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-07 21:43:43,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:43,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:43:43,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:43:43,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:43:43,187 INFO L87 Difference]: Start difference. First operand 775 states and 5267 transitions. Second operand 9 states. [2019-01-07 21:43:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:44,047 INFO L93 Difference]: Finished difference Result 812 states and 5339 transitions. [2019-01-07 21:43:44,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:43:44,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-07 21:43:44,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:44,052 INFO L225 Difference]: With dead ends: 812 [2019-01-07 21:43:44,052 INFO L226 Difference]: Without dead ends: 811 [2019-01-07 21:43:44,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:43:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-01-07 21:43:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 780. [2019-01-07 21:43:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-01-07 21:43:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 5302 transitions. [2019-01-07 21:43:44,420 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 5302 transitions. Word has length 6 [2019-01-07 21:43:44,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:44,421 INFO L480 AbstractCegarLoop]: Abstraction has 780 states and 5302 transitions. [2019-01-07 21:43:44,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:43:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 5302 transitions. [2019-01-07 21:43:44,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:44,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:44,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:44,422 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:44,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:44,422 INFO L82 PathProgramCache]: Analyzing trace with hash 893787660, now seen corresponding path program 1 times [2019-01-07 21:43:44,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:44,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:44,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:44,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:44,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:43:44,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:44,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:44,497 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:44,497 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [30], [31] [2019-01-07 21:43:44,498 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:44,498 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:44,500 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:44,500 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:43:44,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:44,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:44,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:44,501 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-01-07 21:43:44,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:44,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:44,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:44,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:43:44,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:43:44,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,547 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 26 treesize of output 36 [2019-01-07 21:43:44,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-07 21:43:44,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:43:44,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:43:44,573 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:44,609 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:44,630 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:44,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:44,658 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:44,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:44,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:43:44,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,715 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 53 treesize of output 63 [2019-01-07 21:43:44,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:43:44,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:43:44,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:44,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-07 21:43:44,865 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:44,886 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:44,909 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:44,931 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:44,956 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:44,996 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-01-07 21:43:44,996 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-07 21:43:45,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:45,227 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 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-07 21:43:45,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:43:45,445 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-01-07 21:43:45,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-07 21:43:45,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:45,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:45,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:45,585 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-07 21:43:45,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:45,614 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-01-07 21:43:45,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:38 [2019-01-07 21:43:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:45,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:45,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:45,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:45,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 21:43:45,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:45,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:43:45,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:43:45,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:43:45,670 INFO L87 Difference]: Start difference. First operand 780 states and 5302 transitions. Second operand 8 states. [2019-01-07 21:43:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:46,345 INFO L93 Difference]: Finished difference Result 843 states and 5575 transitions. [2019-01-07 21:43:46,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:43:46,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-07 21:43:46,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:46,348 INFO L225 Difference]: With dead ends: 843 [2019-01-07 21:43:46,348 INFO L226 Difference]: Without dead ends: 842 [2019-01-07 21:43:46,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:43:46,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-01-07 21:43:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 813. [2019-01-07 21:43:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-01-07 21:43:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 5533 transitions. [2019-01-07 21:43:46,671 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 5533 transitions. Word has length 6 [2019-01-07 21:43:46,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:46,671 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 5533 transitions. [2019-01-07 21:43:46,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:43:46,671 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 5533 transitions. [2019-01-07 21:43:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:46,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:46,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:46,673 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:46,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:46,673 INFO L82 PathProgramCache]: Analyzing trace with hash 893774142, now seen corresponding path program 1 times [2019-01-07 21:43:46,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:46,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:46,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:46,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:46,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:43:46,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:46,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:46,739 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:46,739 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [29] [2019-01-07 21:43:46,740 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:46,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:46,741 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:46,741 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:43:46,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:46,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:46,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:46,742 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-01-07 21:43:46,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:46,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:46,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:46,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:46,777 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 48 treesize of output 54 [2019-01-07 21:43:46,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:46,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:46,808 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 41 treesize of output 53 [2019-01-07 21:43:46,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:46,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:46,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:46,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:46,846 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 32 treesize of output 61 [2019-01-07 21:43:46,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:46,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:46,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:46,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:46,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:46,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:46,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:43:46,897 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:46,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:46,938 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:46,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:46,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:43:46,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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:43:46,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:43:46,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:43:46,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:43:47,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:43:47,008 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:47,033 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:47,052 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:47,067 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:47,079 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:47,091 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:47,121 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-01-07 21:43:47,121 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-07 21:43:47,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:47,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-07 21:43:47,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:43:47,348 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-01-07 21:43:47,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-01-07 21:43:47,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:47,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:47,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:47,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:47,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:47,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:47,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:47,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:47,495 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 8 case distinctions, treesize of input 65 treesize of output 103 [2019-01-07 21:43:47,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-07 21:43:47,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:47,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:47,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:47,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:47,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:47,794 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:47,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 88 [2019-01-07 21:43:47,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:47,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 19 dim-0 vars, and 6 xjuncts. [2019-01-07 21:43:47,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:126, output treesize:278 [2019-01-07 21:43:48,150 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2019-01-07 21:43:48,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,156 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 88 [2019-01-07 21:43:48,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:48,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,308 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:48,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,310 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 100 [2019-01-07 21:43:48,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:48,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,434 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:48,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,436 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 94 [2019-01-07 21:43:48,437 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:48,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:48,554 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:48,555 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-07 21:43:48,555 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:48,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-01-07 21:43:48,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:227, output treesize:173 [2019-01-07 21:43:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:48,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:48,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:48,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:48,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:43:48,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:48,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:43:48,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:43:48,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:43:48,853 INFO L87 Difference]: Start difference. First operand 813 states and 5533 transitions. Second operand 10 states. [2019-01-07 21:43:49,055 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-01-07 21:43:49,318 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-07 21:43:49,516 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2019-01-07 21:43:49,862 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2019-01-07 21:43:50,489 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-01-07 21:43:50,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:50,781 INFO L93 Difference]: Finished difference Result 896 states and 5824 transitions. [2019-01-07 21:43:50,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:43:50,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:43:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:50,784 INFO L225 Difference]: With dead ends: 896 [2019-01-07 21:43:50,784 INFO L226 Difference]: Without dead ends: 895 [2019-01-07 21:43:50,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:43:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-01-07 21:43:51,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 848. [2019-01-07 21:43:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-01-07 21:43:51,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 5778 transitions. [2019-01-07 21:43:51,164 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 5778 transitions. Word has length 6 [2019-01-07 21:43:51,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:51,164 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 5778 transitions. [2019-01-07 21:43:51,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:43:51,165 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 5778 transitions. [2019-01-07 21:43:51,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:51,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:51,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:51,166 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:51,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:51,167 INFO L82 PathProgramCache]: Analyzing trace with hash 893364756, now seen corresponding path program 1 times [2019-01-07 21:43:51,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:51,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:51,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:51,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:51,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:51,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:51,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:51,246 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:51,246 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [22], [28], [29] [2019-01-07 21:43:51,252 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:51,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:51,254 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:51,254 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:43:51,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:51,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:51,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:51,254 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-01-07 21:43:51,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:51,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:51,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:51,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,292 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 48 treesize of output 54 [2019-01-07 21:43:51,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,323 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 41 treesize of output 53 [2019-01-07 21:43:51,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,361 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 32 treesize of output 61 [2019-01-07 21:43:51,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:43:51,407 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:51,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:51,439 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:51,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:51,477 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 21 treesize of output 24 [2019-01-07 21:43:51,480 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 24 treesize of output 30 [2019-01-07 21:43:51,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, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:43:51,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:43:51,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 30 treesize of output 72 [2019-01-07 21:43:51,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:43:51,497 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:51,521 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:51,540 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:51,555 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:51,567 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:51,578 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:51,608 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-01-07 21:43:51,609 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-07 21:43:51,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,648 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:43:51,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:51,675 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-01-07 21:43:51,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-07 21:43:51,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,703 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-07 21:43:51,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:51,736 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-01-07 21:43:51,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-07 21:43:51,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:51,948 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:51,949 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-07 21:43:51,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:52,065 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-01-07 21:43:52,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-07 21:43:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:52,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:52,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:52,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:43:52,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:52,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:43:52,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:43:52,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:43:52,133 INFO L87 Difference]: Start difference. First operand 848 states and 5778 transitions. Second operand 10 states. [2019-01-07 21:43:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:53,107 INFO L93 Difference]: Finished difference Result 975 states and 6393 transitions. [2019-01-07 21:43:53,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:43:53,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:43:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:53,110 INFO L225 Difference]: With dead ends: 975 [2019-01-07 21:43:53,110 INFO L226 Difference]: Without dead ends: 973 [2019-01-07 21:43:53,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:43:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-01-07 21:43:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 930. [2019-01-07 21:43:53,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-01-07 21:43:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 6346 transitions. [2019-01-07 21:43:53,522 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 6346 transitions. Word has length 6 [2019-01-07 21:43:53,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:53,522 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 6346 transitions. [2019-01-07 21:43:53,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:43:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 6346 transitions. [2019-01-07 21:43:53,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:53,525 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:53,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:53,525 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:53,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:53,525 INFO L82 PathProgramCache]: Analyzing trace with hash 893370586, now seen corresponding path program 1 times [2019-01-07 21:43:53,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:53,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:53,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:53,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:53,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:43:53,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:53,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:53,604 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:53,605 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [30], [31] [2019-01-07 21:43:53,605 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:53,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:53,608 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:53,608 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:43:53,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:53,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:53,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:53,608 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-01-07 21:43:53,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:53,620 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:53,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:53,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:43:53,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:43:53,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,640 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 26 treesize of output 36 [2019-01-07 21:43:53,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,646 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 28 treesize of output 50 [2019-01-07 21:43:53,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:43:53,691 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-07 21:43:53,691 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:53,715 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:53,735 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:53,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:53,762 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:53,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:53,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-07 21:43:53,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-07 21:43:53,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-07 21:43:53,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:53,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-07 21:43:53,889 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:53,903 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:53,916 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:53,931 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:53,986 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-01-07 21:43:53,986 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-07 21:43:54,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:54,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:43:54,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:43:54,118 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-01-07 21:43:54,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-07 21:43:54,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:54,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:54,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:54,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:54,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:54,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:54,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:54,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 86 [2019-01-07 21:43:54,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:54,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:54,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:54,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:54,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:54,230 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:54,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 59 [2019-01-07 21:43:54,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:54,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-07 21:43:54,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:108, output treesize:84 [2019-01-07 21:43:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:54,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:54,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:54,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 21:43:54,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:54,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:43:54,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:43:54,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:43:54,371 INFO L87 Difference]: Start difference. First operand 930 states and 6346 transitions. Second operand 8 states. [2019-01-07 21:43:55,005 WARN L181 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-01-07 21:43:57,121 WARN L181 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-01-07 21:43:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:57,959 INFO L93 Difference]: Finished difference Result 985 states and 6551 transitions. [2019-01-07 21:43:57,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:43:57,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-07 21:43:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:57,963 INFO L225 Difference]: With dead ends: 985 [2019-01-07 21:43:57,963 INFO L226 Difference]: Without dead ends: 984 [2019-01-07 21:43:57,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:43:57,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-01-07 21:43:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 951. [2019-01-07 21:43:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-01-07 21:43:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 6492 transitions. [2019-01-07 21:43:58,408 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 6492 transitions. Word has length 6 [2019-01-07 21:43:58,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:58,408 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 6492 transitions. [2019-01-07 21:43:58,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:43:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 6492 transitions. [2019-01-07 21:43:58,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:43:58,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:58,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:43:58,411 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:58,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:58,411 INFO L82 PathProgramCache]: Analyzing trace with hash 908380782, now seen corresponding path program 1 times [2019-01-07 21:43:58,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:58,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:58,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:58,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:58,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:58,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:58,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:58,509 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:43:58,509 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [24], [27] [2019-01-07 21:43:58,510 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:58,510 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:58,511 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:58,512 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:43:58,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:58,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:58,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:58,512 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-01-07 21:43:58,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:58,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:58,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:58,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,552 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-01-07 21:43:58,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,589 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-01-07 21:43:58,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,632 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-01-07 21:43:58,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,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, 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-01-07 21:43:58,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:58,755 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-01-07 21:43:58,755 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:58,781 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:58,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:58,831 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:58,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:58,892 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 21 treesize of output 24 [2019-01-07 21:43:58,894 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 24 treesize of output 30 [2019-01-07 21:43:58,897 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 26 treesize of output 40 [2019-01-07 21:43:58,900 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 28 treesize of output 54 [2019-01-07 21:43:58,903 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 30 treesize of output 72 [2019-01-07 21:43:58,905 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:43:58,906 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:58,939 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:58,959 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:58,973 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:58,986 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:58,997 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:59,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:43:59,040 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-07 21:43:59,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,084 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-01-07 21:43:59,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:59,127 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-01-07 21:43:59,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-07 21:43:59,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,171 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-01-07 21:43:59,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:59,215 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-01-07 21:43:59,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-07 21:43:59,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,255 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:59,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,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, 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-01-07 21:43:59,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:59,303 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-01-07 21:43:59,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-07 21:43:59,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,346 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:59,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:59,348 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-01-07 21:43:59,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:59,396 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-01-07 21:43:59,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-07 21:43:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:59,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:43:59,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:59,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:43:59,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:59,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:43:59,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:43:59,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:43:59,625 INFO L87 Difference]: Start difference. First operand 951 states and 6492 transitions. Second operand 12 states. [2019-01-07 21:44:04,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:44:04,015 INFO L93 Difference]: Finished difference Result 1024 states and 6701 transitions. [2019-01-07 21:44:04,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:44:04,015 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:44:04,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:44:04,020 INFO L225 Difference]: With dead ends: 1024 [2019-01-07 21:44:04,020 INFO L226 Difference]: Without dead ends: 1023 [2019-01-07 21:44:04,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-01-07 21:44:04,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-01-07 21:44:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 948. [2019-01-07 21:44:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-01-07 21:44:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 6467 transitions. [2019-01-07 21:44:04,434 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 6467 transitions. Word has length 6 [2019-01-07 21:44:04,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:44:04,434 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 6467 transitions. [2019-01-07 21:44:04,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:44:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 6467 transitions. [2019-01-07 21:44:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:44:04,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:44:04,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:44:04,436 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:44:04,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:04,436 INFO L82 PathProgramCache]: Analyzing trace with hash 908380906, now seen corresponding path program 1 times [2019-01-07 21:44:04,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:44:04,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:04,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:04,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:04,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:44:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:04,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:04,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:44:04,635 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:44:04,635 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [27] [2019-01-07 21:44:04,636 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:44:04,636 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:44:04,638 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:44:04,638 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:44:04,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:04,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:44:04,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:04,639 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-01-07 21:44:04,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:04,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:44:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:04,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:44:04,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:44:04,691 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 24 treesize of output 30 [2019-01-07 21:44:04,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:44:04,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,701 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 28 treesize of output 54 [2019-01-07 21:44:04,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:44:04,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,716 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:44:04,716 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:04,755 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:04,776 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:04,794 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:04,808 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:04,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:04,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,851 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-01-07 21:44:04,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,887 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-01-07 21:44:04,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-01-07 21:44:04,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:04,986 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-01-07 21:44:05,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,056 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-01-07 21:44:05,056 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:05,081 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:05,105 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:05,129 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:05,153 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:05,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:44:05,196 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-07 21:44:05,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,239 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-01-07 21:44:05,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:05,281 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-01-07 21:44:05,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-07 21:44:05,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,326 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-01-07 21:44:05,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:05,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:44:05,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-07 21:44:05,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,414 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:05,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,415 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-01-07 21:44:05,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:05,463 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-01-07 21:44:05,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-07 21:44:05,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,506 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:05,506 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 125 [2019-01-07 21:44:05,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:05,555 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-01-07 21:44:05,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-01-07 21:44:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:05,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:44:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:05,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:44:05,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-07 21:44:05,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:44:05,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:44:05,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:44:05,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:44:05,667 INFO L87 Difference]: Start difference. First operand 948 states and 6467 transitions. Second operand 12 states. [2019-01-07 21:44:08,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:44:08,176 INFO L93 Difference]: Finished difference Result 1059 states and 6958 transitions. [2019-01-07 21:44:08,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:44:08,176 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:44:08,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:44:08,180 INFO L225 Difference]: With dead ends: 1059 [2019-01-07 21:44:08,180 INFO L226 Difference]: Without dead ends: 1057 [2019-01-07 21:44:08,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:44:08,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-01-07 21:44:08,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 945. [2019-01-07 21:44:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-01-07 21:44:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 6457 transitions. [2019-01-07 21:44:08,627 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 6457 transitions. Word has length 6 [2019-01-07 21:44:08,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:44:08,628 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 6457 transitions. [2019-01-07 21:44:08,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:44:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 6457 transitions. [2019-01-07 21:44:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:44:08,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:44:08,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:44:08,629 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:44:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:08,630 INFO L82 PathProgramCache]: Analyzing trace with hash 908367452, now seen corresponding path program 1 times [2019-01-07 21:44:08,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:44:08,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:08,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:08,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:08,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:44:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:08,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:08,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:44:08,715 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:44:08,715 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [27] [2019-01-07 21:44:08,716 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:44:08,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:44:08,718 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:44:08,718 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:44:08,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:08,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:44:08,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:08,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 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-01-07 21:44:08,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:08,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:44:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:08,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:44:08,754 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 21 treesize of output 24 [2019-01-07 21:44:08,756 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 24 treesize of output 30 [2019-01-07 21:44:08,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:08,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:08,761 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 26 treesize of output 40 [2019-01-07 21:44:08,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:08,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:08,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:08,766 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 28 treesize of output 54 [2019-01-07 21:44:08,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:08,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:08,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:08,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:08,774 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 30 treesize of output 72 [2019-01-07 21:44:08,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:44:08,783 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:08,810 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:08,832 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:08,849 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:08,863 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:08,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:08,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:08,904 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 48 treesize of output 54 [2019-01-07 21:44:08,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:08,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:08,935 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 41 treesize of output 53 [2019-01-07 21:44:08,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:08,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:08,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:08,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:08,971 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 32 treesize of output 61 [2019-01-07 21:44:09,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:44:09,018 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:09,034 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:09,049 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:09,062 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:09,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:44:09,093 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-01-07 21:44:09,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,158 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:44:09,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:09,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:44:09,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-07 21:44:09,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,222 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-07 21:44:09,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:09,251 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-01-07 21:44:09,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-07 21:44:09,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,287 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:09,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,289 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-07 21:44:09,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:09,322 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-01-07 21:44:09,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-07 21:44:09,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:09,357 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:09,357 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-07 21:44:09,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:09,389 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-01-07 21:44:09,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:44:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:09,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:44:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:09,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:44:09,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:44:09,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:44:09,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:44:09,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:44:09,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:44:09,490 INFO L87 Difference]: Start difference. First operand 945 states and 6457 transitions. Second operand 12 states. [2019-01-07 21:44:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:44:11,678 INFO L93 Difference]: Finished difference Result 1044 states and 6871 transitions. [2019-01-07 21:44:11,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:44:11,679 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:44:11,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:44:11,683 INFO L225 Difference]: With dead ends: 1044 [2019-01-07 21:44:11,683 INFO L226 Difference]: Without dead ends: 1042 [2019-01-07 21:44:11,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-01-07 21:44:11,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-01-07 21:44:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 982. [2019-01-07 21:44:12,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-01-07 21:44:12,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 6716 transitions. [2019-01-07 21:44:12,147 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 6716 transitions. Word has length 6 [2019-01-07 21:44:12,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:44:12,148 INFO L480 AbstractCegarLoop]: Abstraction has 982 states and 6716 transitions. [2019-01-07 21:44:12,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:44:12,148 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 6716 transitions. [2019-01-07 21:44:12,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:44:12,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:44:12,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:44:12,149 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:44:12,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:12,150 INFO L82 PathProgramCache]: Analyzing trace with hash 908371606, now seen corresponding path program 2 times [2019-01-07 21:44:12,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:44:12,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:12,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:12,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:12,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:44:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:12,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:12,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:44:12,258 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:44:12,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:44:12,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:12,258 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-01-07 21:44:12,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:44:12,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:44:12,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:44:12,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:44:12,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:44:12,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,295 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-01-07 21:44:12,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,333 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-01-07 21:44:12,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,375 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-01-07 21:44:12,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,430 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-01-07 21:44:12,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,499 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-01-07 21:44:12,499 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:12,525 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:12,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:12,575 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:12,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:12,635 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 21 treesize of output 24 [2019-01-07 21:44:12,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, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:44:12,641 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 26 treesize of output 40 [2019-01-07 21:44:12,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:44:12,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:44:12,648 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:44:12,649 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:12,683 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:12,702 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:12,717 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:12,730 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:12,741 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:12,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:44:12,784 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-07 21:44:12,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,828 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-01-07 21:44:12,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:12,870 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-01-07 21:44:12,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-07 21:44:12,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,910 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-01-07 21:44:12,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:12,953 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-01-07 21:44:12,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-07 21:44:12,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:12,999 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:13,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 123 [2019-01-07 21:44:13,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:13,049 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-01-07 21:44:13,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-07 21:44:13,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:13,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:13,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:13,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:13,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:13,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:13,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:13,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:13,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:13,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:13,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:13,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:13,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:13,093 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:13,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:13,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, 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-01-07 21:44:13,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:13,143 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-01-07 21:44:13,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-07 21:44:13,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:13,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:44:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:13,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:44:13,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:44:13,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:44:13,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:44:13,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:44:13,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:44:13,426 INFO L87 Difference]: Start difference. First operand 982 states and 6716 transitions. Second operand 12 states. [2019-01-07 21:44:14,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:44:14,699 INFO L93 Difference]: Finished difference Result 1044 states and 6839 transitions. [2019-01-07 21:44:14,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:44:14,700 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:44:14,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:44:14,704 INFO L225 Difference]: With dead ends: 1044 [2019-01-07 21:44:14,704 INFO L226 Difference]: Without dead ends: 1041 [2019-01-07 21:44:14,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-01-07 21:44:14,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-01-07 21:44:15,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 980. [2019-01-07 21:44:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-01-07 21:44:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 6702 transitions. [2019-01-07 21:44:15,131 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 6702 transitions. Word has length 6 [2019-01-07 21:44:15,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:44:15,132 INFO L480 AbstractCegarLoop]: Abstraction has 980 states and 6702 transitions. [2019-01-07 21:44:15,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:44:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 6702 transitions. [2019-01-07 21:44:15,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:44:15,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:44:15,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:44:15,133 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:44:15,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:15,134 INFO L82 PathProgramCache]: Analyzing trace with hash 908017958, now seen corresponding path program 1 times [2019-01-07 21:44:15,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:44:15,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:15,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:44:15,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:15,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:44:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:15,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:15,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:44:15,224 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:44:15,224 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [27] [2019-01-07 21:44:15,225 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:44:15,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:44:15,227 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:44:15,227 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:44:15,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:15,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:44:15,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:15,227 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-01-07 21:44:15,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:15,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:44:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:15,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:44:15,263 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 21 treesize of output 24 [2019-01-07 21:44:15,265 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 24 treesize of output 30 [2019-01-07 21:44:15,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,271 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 26 treesize of output 40 [2019-01-07 21:44:15,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,276 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 28 treesize of output 54 [2019-01-07 21:44:15,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,286 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 30 treesize of output 72 [2019-01-07 21:44:15,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:44:15,294 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:15,320 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:15,342 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:15,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:15,372 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:15,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:15,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,413 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 48 treesize of output 54 [2019-01-07 21:44:15,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,445 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 41 treesize of output 53 [2019-01-07 21:44:15,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,480 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 32 treesize of output 61 [2019-01-07 21:44:15,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:44:15,528 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:15,561 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:15,576 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:15,592 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:15,622 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-01-07 21:44:15,623 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-07 21:44:15,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-07 21:44:15,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:44:15,837 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-01-07 21:44:15,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-01-07 21:44:15,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:15,964 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:15,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 93 [2019-01-07 21:44:15,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:44:16,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,122 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:16,123 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 80 [2019-01-07 21:44:16,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:16,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-07 21:44:16,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:135 [2019-01-07 21:44:16,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,338 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 2 case distinctions, treesize of input 57 treesize of output 95 [2019-01-07 21:44:16,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:44:16,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,509 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 93 [2019-01-07 21:44:16,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:16,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 86 [2019-01-07 21:44:16,628 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:16,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2019-01-07 21:44:16,720 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:165, output treesize:147 [2019-01-07 21:44:16,853 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-07 21:44:16,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 102 [2019-01-07 21:44:16,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:16,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:16,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,004 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:17,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,020 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 4 case distinctions, treesize of input 51 treesize of output 118 [2019-01-07 21:44:17,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-01-07 21:44:17,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,316 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:17,317 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 92 [2019-01-07 21:44:17,318 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:17,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:17,474 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:17,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 98 [2019-01-07 21:44:17,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:17,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-07 21:44:17,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 21 variables, input treesize:190, output treesize:230 [2019-01-07 21:44:17,812 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 103 [2019-01-07 21:44:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:17,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:44:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:17,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:44:17,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:44:17,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:44:17,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:44:17,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:44:17,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:44:17,928 INFO L87 Difference]: Start difference. First operand 980 states and 6702 transitions. Second operand 12 states. [2019-01-07 21:44:18,128 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-07 21:44:18,403 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-07 21:44:18,811 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-01-07 21:44:19,251 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2019-01-07 21:44:19,725 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-01-07 21:44:20,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:44:20,571 INFO L93 Difference]: Finished difference Result 1104 states and 7131 transitions. [2019-01-07 21:44:20,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:44:20,571 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:44:20,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:44:20,576 INFO L225 Difference]: With dead ends: 1104 [2019-01-07 21:44:20,576 INFO L226 Difference]: Without dead ends: 1102 [2019-01-07 21:44:20,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-07 21:44:20,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-01-07 21:44:21,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 984. [2019-01-07 21:44:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-01-07 21:44:21,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 6730 transitions. [2019-01-07 21:44:21,014 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 6730 transitions. Word has length 6 [2019-01-07 21:44:21,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:44:21,014 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 6730 transitions. [2019-01-07 21:44:21,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:44:21,014 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 6730 transitions. [2019-01-07 21:44:21,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:44:21,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:44:21,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:44:21,016 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:44:21,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:21,016 INFO L82 PathProgramCache]: Analyzing trace with hash 908017524, now seen corresponding path program 1 times [2019-01-07 21:44:21,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:44:21,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:21,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:21,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:21,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:44:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:21,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:21,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:44:21,098 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:44:21,099 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [27] [2019-01-07 21:44:21,099 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:44:21,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:44:21,100 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:44:21,100 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:44:21,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:21,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:44:21,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:21,101 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-01-07 21:44:21,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:21,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:44:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:21,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:44:21,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-07 21:44:21,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,170 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 41 treesize of output 53 [2019-01-07 21:44:21,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,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 32 treesize of output 61 [2019-01-07 21:44:21,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:44:21,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:21,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:21,296 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:21,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:21,349 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 21 treesize of output 24 [2019-01-07 21:44:21,352 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 24 treesize of output 30 [2019-01-07 21:44:21,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:44:21,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:44:21,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:44:21,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:44:21,368 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:21,392 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:21,411 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:21,425 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:21,438 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:21,449 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:21,479 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-01-07 21:44:21,479 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-07 21:44:21,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,532 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:44:21,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:21,560 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-01-07 21:44:21,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-07 21:44:21,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,594 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:21,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-07 21:44:21,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:21,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:44:21,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2019-01-07 21:44:21,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,657 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-07 21:44:21,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:21,687 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-01-07 21:44:21,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-07 21:44:21,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,718 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:21,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:21,720 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-07 21:44:21,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:21,753 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-01-07 21:44:21,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:34 [2019-01-07 21:44:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:21,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:44:21,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:21,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:44:21,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-07 21:44:21,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:44:21,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:44:21,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:44:21,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:44:21,838 INFO L87 Difference]: Start difference. First operand 984 states and 6730 transitions. Second operand 12 states. [2019-01-07 21:44:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:44:24,153 INFO L93 Difference]: Finished difference Result 1313 states and 8698 transitions. [2019-01-07 21:44:24,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-07 21:44:24,154 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:44:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:44:24,158 INFO L225 Difference]: With dead ends: 1313 [2019-01-07 21:44:24,158 INFO L226 Difference]: Without dead ends: 1312 [2019-01-07 21:44:24,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:44:24,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-01-07 21:44:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 839. [2019-01-07 21:44:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-01-07 21:44:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 5721 transitions. [2019-01-07 21:44:24,630 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 5721 transitions. Word has length 6 [2019-01-07 21:44:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:44:24,630 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 5721 transitions. [2019-01-07 21:44:24,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:44:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 5721 transitions. [2019-01-07 21:44:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:44:24,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:44:24,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:44:24,632 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:44:24,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:24,632 INFO L82 PathProgramCache]: Analyzing trace with hash 908550478, now seen corresponding path program 1 times [2019-01-07 21:44:24,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:44:24,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:24,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:24,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:24,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:44:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:24,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:24,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:44:24,691 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:44:24,691 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [24], [28], [29] [2019-01-07 21:44:24,692 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:44:24,692 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:44:24,694 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:44:24,694 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:44:24,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:24,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:44:24,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:24,694 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-01-07 21:44:24,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:24,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:44:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:24,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:44:24,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:44:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:44:24,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:24,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:24,878 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 26 treesize of output 36 [2019-01-07 21:44:24,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:24,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:24,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:24,983 INFO L303 Elim1Store]: Index analysis took 103 ms [2019-01-07 21:44:24,983 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 28 treesize of output 50 [2019-01-07 21:44:25,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:25,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:25,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:25,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:25,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:44:25,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:25,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:25,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:25,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:25,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:25,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:44:25,094 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:25,560 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:25,812 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:26,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:26,181 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:26,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:26,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:44:26,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,730 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 53 treesize of output 63 [2019-01-07 21:44:26,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:44:26,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:44:26,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:26,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-07 21:44:26,944 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:26,966 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:26,988 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:27,011 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:27,036 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:27,076 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-01-07 21:44:27,077 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-07 21:44:27,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,110 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 41 treesize of output 93 [2019-01-07 21:44:27,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:27,151 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-01-07 21:44:27,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-07 21:44:27,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 107 [2019-01-07 21:44:27,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:27,232 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-01-07 21:44:27,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-01-07 21:44:27,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:27,327 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:27,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 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-01-07 21:44:27,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:27,374 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-01-07 21:44:27,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-01-07 21:44:27,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:27,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:44:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:27,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:44:27,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:44:27,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:44:27,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:44:27,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:44:27,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:44:27,452 INFO L87 Difference]: Start difference. First operand 839 states and 5721 transitions. Second operand 10 states. [2019-01-07 21:44:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:44:28,425 INFO L93 Difference]: Finished difference Result 881 states and 5780 transitions. [2019-01-07 21:44:28,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:44:28,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:44:28,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:44:28,428 INFO L225 Difference]: With dead ends: 881 [2019-01-07 21:44:28,428 INFO L226 Difference]: Without dead ends: 880 [2019-01-07 21:44:28,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 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-01-07 21:44:28,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-01-07 21:44:28,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 841. [2019-01-07 21:44:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-01-07 21:44:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 5735 transitions. [2019-01-07 21:44:28,877 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 5735 transitions. Word has length 6 [2019-01-07 21:44:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:44:28,877 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 5735 transitions. [2019-01-07 21:44:28,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:44:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 5735 transitions. [2019-01-07 21:44:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:44:28,878 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:44:28,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:44:28,879 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:44:28,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:28,879 INFO L82 PathProgramCache]: Analyzing trace with hash 908133404, now seen corresponding path program 1 times [2019-01-07 21:44:28,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:44:28,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:28,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:28,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:28,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:44:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:28,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:28,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:44:28,966 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:44:28,966 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [28], [29] [2019-01-07 21:44:28,966 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:44:28,966 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:44:28,969 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:44:28,969 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:44:28,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:28,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:44:28,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:28,969 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-01-07 21:44:28,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:28,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:44:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:28,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:44:28,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:44:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:44:28,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:28,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:28,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-07 21:44:29,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,007 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 28 treesize of output 50 [2019-01-07 21:44:29,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,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, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:44:29,023 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-07 21:44:29,023 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:29,047 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:29,067 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:29,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:29,095 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:29,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:29,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-07 21:44:29,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,146 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 36 treesize of output 49 [2019-01-07 21:44:29,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-07 21:44:29,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-07 21:44:29,225 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:29,239 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:29,253 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:29,268 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:29,295 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-01-07 21:44:29,296 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-07 21:44:29,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-07 21:44:29,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:29,361 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-01-07 21:44:29,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-07 21:44:29,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-07 21:44:29,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:44:29,516 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-01-07 21:44:29,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-07 21:44:29,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:29,563 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:29,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-07 21:44:29,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:29,586 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-01-07 21:44:29,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-07 21:44:29,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:29,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:44:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:29,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:44:29,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:44:29,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:44:29,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:44:29,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:44:29,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:44:29,652 INFO L87 Difference]: Start difference. First operand 841 states and 5735 transitions. Second operand 10 states. [2019-01-07 21:44:30,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:44:30,900 INFO L93 Difference]: Finished difference Result 1415 states and 9444 transitions. [2019-01-07 21:44:30,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:44:30,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:44:30,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:44:30,905 INFO L225 Difference]: With dead ends: 1415 [2019-01-07 21:44:30,905 INFO L226 Difference]: Without dead ends: 1413 [2019-01-07 21:44:30,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:44:30,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-01-07 21:44:31,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1280. [2019-01-07 21:44:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-01-07 21:44:31,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 8838 transitions. [2019-01-07 21:44:31,704 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 8838 transitions. Word has length 6 [2019-01-07 21:44:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:44:31,704 INFO L480 AbstractCegarLoop]: Abstraction has 1280 states and 8838 transitions. [2019-01-07 21:44:31,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:44:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 8838 transitions. [2019-01-07 21:44:31,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:44:31,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:44:31,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:44:31,707 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:44:31,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:31,707 INFO L82 PathProgramCache]: Analyzing trace with hash 909988134, now seen corresponding path program 1 times [2019-01-07 21:44:31,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:44:31,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:31,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:31,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:31,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:44:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:31,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:31,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:31,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:44:31,769 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:44:31,770 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [29] [2019-01-07 21:44:31,770 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:44:31,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:44:31,772 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:44:31,772 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:44:31,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:31,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:44:31,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:31,772 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-01-07 21:44:31,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:31,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:44:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:31,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:44:31,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-07 21:44:31,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:31,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:31,808 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 36 treesize of output 49 [2019-01-07 21:44:31,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:31,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:31,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:31,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:31,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-07 21:44:31,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:31,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:31,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:31,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:31,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:31,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:31,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-07 21:44:31,895 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:31,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:31,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:31,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:31,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:44:31,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, 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 26 [2019-01-07 21:44:31,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-07 21:44:31,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-07 21:44:31,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:44:31,986 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-07 21:44:31,986 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:32,010 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:32,027 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:32,041 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:32,052 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:32,063 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:32,091 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-01-07 21:44:32,091 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-07 21:44:32,300 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-07 21:44:32,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:32,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-01-07 21:44:32,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-01-07 21:44:32,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-01-07 21:44:32,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:361 [2019-01-07 21:44:32,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:32,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:32,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:32,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:32,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:32,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:32,836 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:32,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 99 [2019-01-07 21:44:32,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:44:33,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 61 [2019-01-07 21:44:33,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:33,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,114 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:33,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 93 [2019-01-07 21:44:33,124 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-07 21:44:33,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2019-01-07 21:44:33,274 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:166, output treesize:180 [2019-01-07 21:44:33,392 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 60 [2019-01-07 21:44:33,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 75 [2019-01-07 21:44:33,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:33,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 61 [2019-01-07 21:44:33,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:33,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:33,533 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:33,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 61 [2019-01-07 21:44:33,536 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:33,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-07 21:44:33,673 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:132, output treesize:92 [2019-01-07 21:44:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:35,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:44:35,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:35,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:44:35,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:44:35,802 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:44:35,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:44:35,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:44:35,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=112, Unknown=1, NotChecked=0, Total=182 [2019-01-07 21:44:35,802 INFO L87 Difference]: Start difference. First operand 1280 states and 8838 transitions. Second operand 10 states. [2019-01-07 21:44:36,218 WARN L181 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-07 21:44:36,845 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-01-07 21:44:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:44:45,887 INFO L93 Difference]: Finished difference Result 1381 states and 9127 transitions. [2019-01-07 21:44:45,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:44:45,887 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:44:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:44:45,891 INFO L225 Difference]: With dead ends: 1381 [2019-01-07 21:44:45,891 INFO L226 Difference]: Without dead ends: 1379 [2019-01-07 21:44:45,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=107, Invalid=198, Unknown=1, NotChecked=0, Total=306 [2019-01-07 21:44:45,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-01-07 21:44:46,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1274. [2019-01-07 21:44:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-01-07 21:44:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-01-07 21:44:46,649 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-01-07 21:44:46,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:44:46,649 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-01-07 21:44:46,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:44:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-01-07 21:44:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:44:46,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:44:46,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:44:46,651 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:44:46,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:46,652 INFO L82 PathProgramCache]: Analyzing trace with hash 909993964, now seen corresponding path program 1 times [2019-01-07 21:44:46,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:44:46,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:46,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:46,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:46,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:44:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:44:46,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:46,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:44:46,705 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:44:46,705 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [28], [30], [31] [2019-01-07 21:44:46,706 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:44:46,706 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:44:46,708 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:44:46,708 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:44:46,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:46,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:44:46,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:46,709 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:44:46,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:46,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:44:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:46,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:44:46,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:44:46,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,743 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 53 treesize of output 63 [2019-01-07 21:44:46,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:44:46,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:44:46,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:46,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-07 21:44:46,898 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:46,928 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:46,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:46,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:47,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:47,033 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 21 treesize of output 24 [2019-01-07 21:44:47,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:44:47,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-07 21:44:47,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-07 21:44:47,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:44:47,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:44:47,073 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:47,104 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:47,122 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:47,136 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:47,147 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:47,158 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:47,198 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-01-07 21:44:47,198 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-07 21:44:47,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:47,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, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-07 21:44:47,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:47,264 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-01-07 21:44:47,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-07 21:44:47,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:47,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:47,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:47,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:47,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:47,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:47,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:47,295 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:47,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 2 case distinctions, treesize of input 43 treesize of output 112 [2019-01-07 21:44:47,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:44:47,441 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-01-07 21:44:47,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:110 [2019-01-07 21:44:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:47,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:44:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:47,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:44:47,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:44:47,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:44:47,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:44:47,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:44:47,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:44:47,562 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 8 states. [2019-01-07 21:44:48,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:44:48,747 INFO L93 Difference]: Finished difference Result 1306 states and 8833 transitions. [2019-01-07 21:44:48,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:44:48,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-07 21:44:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:44:48,751 INFO L225 Difference]: With dead ends: 1306 [2019-01-07 21:44:48,751 INFO L226 Difference]: Without dead ends: 1305 [2019-01-07 21:44:48,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:44:48,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2019-01-07 21:44:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1274. [2019-01-07 21:44:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-01-07 21:44:49,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-01-07 21:44:49,545 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-01-07 21:44:49,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:44:49,545 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-01-07 21:44:49,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:44:49,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-01-07 21:44:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:44:49,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:44:49,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:44:49,548 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:44:49,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:49,548 INFO L82 PathProgramCache]: Analyzing trace with hash 909980134, now seen corresponding path program 1 times [2019-01-07 21:44:49,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:44:49,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:49,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:49,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:49,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:44:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:49,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:49,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:44:49,760 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:44:49,760 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [27] [2019-01-07 21:44:49,761 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:44:49,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:44:49,763 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:44:49,763 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:44:49,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:49,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:44:49,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:49,764 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:44:49,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:49,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:44:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:49,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:44:49,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:49,806 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-01-07 21:44:49,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:49,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:49,842 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-01-07 21:44:49,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:49,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:49,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:49,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:49,885 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-01-07 21:44:49,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:49,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:49,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:49,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:49,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:49,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:49,940 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-01-07 21:44:49,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:49,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:49,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,005 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-01-07 21:44:50,005 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:50,030 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:50,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:50,081 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:50,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:50,140 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 21 treesize of output 24 [2019-01-07 21:44:50,142 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 24 treesize of output 30 [2019-01-07 21:44:50,163 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 26 treesize of output 40 [2019-01-07 21:44:50,167 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 28 treesize of output 54 [2019-01-07 21:44:50,169 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 30 treesize of output 72 [2019-01-07 21:44:50,171 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:44:50,172 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:50,205 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:50,224 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:50,239 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:50,252 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:50,263 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:50,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:44:50,306 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-07 21:44:50,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,346 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-01-07 21:44:50,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:50,390 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-01-07 21:44:50,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-07 21:44:50,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,433 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:50,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, 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-01-07 21:44:50,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:50,480 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-01-07 21:44:50,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:59 [2019-01-07 21:44:50,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,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 45 treesize of output 115 [2019-01-07 21:44:50,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:50,571 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-01-07 21:44:50,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:51 [2019-01-07 21:44:50,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:50,613 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:50,614 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-01-07 21:44:50,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:50,660 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-01-07 21:44:50,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-07 21:44:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:50,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:44:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:50,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:44:50,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:44:50,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:44:50,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:44:50,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:44:50,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:44:50,775 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 12 states. [2019-01-07 21:44:52,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:44:52,377 INFO L93 Difference]: Finished difference Result 1360 states and 9097 transitions. [2019-01-07 21:44:52,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:44:52,377 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:44:52,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:44:52,383 INFO L225 Difference]: With dead ends: 1360 [2019-01-07 21:44:52,383 INFO L226 Difference]: Without dead ends: 1358 [2019-01-07 21:44:52,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-01-07 21:44:52,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-01-07 21:44:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1309. [2019-01-07 21:44:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-01-07 21:44:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 9030 transitions. [2019-01-07 21:44:53,180 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 9030 transitions. Word has length 6 [2019-01-07 21:44:53,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:44:53,181 INFO L480 AbstractCegarLoop]: Abstraction has 1309 states and 9030 transitions. [2019-01-07 21:44:53,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:44:53,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 9030 transitions. [2019-01-07 21:44:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:44:53,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:44:53,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:44:53,183 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:44:53,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:53,183 INFO L82 PathProgramCache]: Analyzing trace with hash 896939676, now seen corresponding path program 2 times [2019-01-07 21:44:53,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:44:53,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:53,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:53,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:53,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:44:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:44:53,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:53,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:44:53,265 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:44:53,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:44:53,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:53,265 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:44:53,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:44:53,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:44:53,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:44:53,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:44:53,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:44:53,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-07 21:44:53,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,343 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-01-07 21:44:53,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,383 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-01-07 21:44:53,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,439 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-01-07 21:44:53,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:53,507 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-01-07 21:44:53,507 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:53,532 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:53,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:53,962 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:53,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:54,023 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 21 treesize of output 24 [2019-01-07 21:44:54,026 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 24 treesize of output 30 [2019-01-07 21:44:54,028 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 26 treesize of output 40 [2019-01-07 21:44:54,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:44:54,033 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 30 treesize of output 72 [2019-01-07 21:44:54,036 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:44:54,037 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:54,071 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:54,091 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:54,106 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:54,119 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:54,130 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:54,174 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-01-07 21:44:54,174 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-07 21:44:54,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,201 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-01-07 21:44:54,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:54,243 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-01-07 21:44:54,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-07 21:44:54,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,276 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-01-07 21:44:54,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:54,351 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-01-07 21:44:54,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-07 21:44:54,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:54,384 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:54,385 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-01-07 21:44:54,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:54,430 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-01-07 21:44:54,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-01-07 21:44:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:54,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:44:54,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:54,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:44:54,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:44:54,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:44:54,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:44:54,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:44:54,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:44:54,506 INFO L87 Difference]: Start difference. First operand 1309 states and 9030 transitions. Second operand 10 states. [2019-01-07 21:44:56,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:44:56,277 INFO L93 Difference]: Finished difference Result 1898 states and 12744 transitions. [2019-01-07 21:44:56,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:44:56,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:44:56,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:44:56,283 INFO L225 Difference]: With dead ends: 1898 [2019-01-07 21:44:56,283 INFO L226 Difference]: Without dead ends: 1896 [2019-01-07 21:44:56,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:44:56,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-07 21:44:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1669. [2019-01-07 21:44:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-01-07 21:44:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 11590 transitions. [2019-01-07 21:44:57,365 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 11590 transitions. Word has length 6 [2019-01-07 21:44:57,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:44:57,365 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 11590 transitions. [2019-01-07 21:44:57,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:44:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 11590 transitions. [2019-01-07 21:44:57,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:44:57,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:44:57,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:44:57,369 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:44:57,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:57,370 INFO L82 PathProgramCache]: Analyzing trace with hash 897602894, now seen corresponding path program 1 times [2019-01-07 21:44:57,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:44:57,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:57,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:44:57,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:57,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:44:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:57,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:44:57,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:44:57,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-07 21:44:57,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:44:57,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-07 21:44:57,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-07 21:44:57,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-07 21:44:57,448 INFO L87 Difference]: Start difference. First operand 1669 states and 11590 transitions. Second operand 5 states. [2019-01-07 21:44:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:44:58,641 INFO L93 Difference]: Finished difference Result 1693 states and 11616 transitions. [2019-01-07 21:44:58,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 21:44:58,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-07 21:44:58,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:44:58,645 INFO L225 Difference]: With dead ends: 1693 [2019-01-07 21:44:58,646 INFO L226 Difference]: Without dead ends: 1692 [2019-01-07 21:44:58,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-07 21:44:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2019-01-07 21:44:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1672. [2019-01-07 21:44:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-01-07 21:44:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 11593 transitions. [2019-01-07 21:44:59,709 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 11593 transitions. Word has length 6 [2019-01-07 21:44:59,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:44:59,709 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 11593 transitions. [2019-01-07 21:44:59,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-07 21:44:59,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 11593 transitions. [2019-01-07 21:44:59,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:44:59,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:44:59,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:44:59,712 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:44:59,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:59,712 INFO L82 PathProgramCache]: Analyzing trace with hash 900997082, now seen corresponding path program 1 times [2019-01-07 21:44:59,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:44:59,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:59,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:59,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:59,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:44:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:59,874 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-01-07 21:44:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:44:59,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:59,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:44:59,885 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:44:59,885 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [28], [30], [31] [2019-01-07 21:44:59,886 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:44:59,886 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:44:59,888 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:44:59,888 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:44:59,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:59,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:44:59,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:59,889 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:44:59,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:59,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:44:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:59,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:44:59,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:44:59,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:44:59,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:59,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:59,914 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 26 treesize of output 36 [2019-01-07 21:44:59,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:59,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:59,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:59,922 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 28 treesize of output 50 [2019-01-07 21:44:59,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:59,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:59,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:59,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:59,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:44:59,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:59,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:59,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:59,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:59,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:59,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:44:59,942 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:59,983 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:00,003 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:00,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:00,031 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:00,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:00,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:45:00,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,086 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 53 treesize of output 63 [2019-01-07 21:45:00,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:45:00,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:45:00,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-07 21:45:00,244 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:00,267 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:00,289 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:00,309 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:00,334 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:00,375 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-01-07 21:45:00,375 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-01-07 21:45:00,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,395 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 41 treesize of output 93 [2019-01-07 21:45:00,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:00,435 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-01-07 21:45:00,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-07 21:45:00,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:00,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 99 [2019-01-07 21:45:00,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:00,507 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-01-07 21:45:00,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:51 [2019-01-07 21:45:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:45:00,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:45:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:45:00,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:45:00,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 21:45:00,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:45:00,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:45:00,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:45:00,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:45:00,554 INFO L87 Difference]: Start difference. First operand 1672 states and 11593 transitions. Second operand 8 states. [2019-01-07 21:45:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:45:02,774 INFO L93 Difference]: Finished difference Result 2759 states and 18997 transitions. [2019-01-07 21:45:02,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:45:02,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-07 21:45:02,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:45:02,783 INFO L225 Difference]: With dead ends: 2759 [2019-01-07 21:45:02,784 INFO L226 Difference]: Without dead ends: 2757 [2019-01-07 21:45:02,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:45:02,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2019-01-07 21:45:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2639. [2019-01-07 21:45:04,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-01-07 21:45:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 18434 transitions. [2019-01-07 21:45:04,619 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 18434 transitions. Word has length 6 [2019-01-07 21:45:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:45:04,619 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 18434 transitions. [2019-01-07 21:45:04,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:45:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 18434 transitions. [2019-01-07 21:45:04,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:45:04,623 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:45:04,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:45:04,623 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:45:04,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:45:04,623 INFO L82 PathProgramCache]: Analyzing trace with hash 900629790, now seen corresponding path program 1 times [2019-01-07 21:45:04,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:45:04,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:45:04,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:45:04,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:45:04,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:45:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:45:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:45:04,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:45:04,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:45:04,747 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:45:04,747 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [27] [2019-01-07 21:45:04,750 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:45:04,750 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:45:04,751 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:45:04,752 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:45:04,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:45:04,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:45:04,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:45:04,752 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:45:04,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:45:04,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:45:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:45:04,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:45:04,799 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 21 treesize of output 24 [2019-01-07 21:45:04,802 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 24 treesize of output 30 [2019-01-07 21:45:04,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:04,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:04,807 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 26 treesize of output 40 [2019-01-07 21:45:04,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:04,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:04,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:04,813 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 28 treesize of output 54 [2019-01-07 21:45:04,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:04,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:04,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:04,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:04,821 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 30 treesize of output 72 [2019-01-07 21:45:04,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:04,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:04,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:04,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:04,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:04,829 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:45:04,830 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:04,867 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:04,889 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:04,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:04,921 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:04,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:04,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:04,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-01-07 21:45:05,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,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-01-07 21:45:05,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-01-07 21:45:05,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,100 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-01-07 21:45:05,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,168 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-01-07 21:45:05,168 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:05,191 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:05,215 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:05,241 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:05,267 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:05,309 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-01-07 21:45:05,309 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-07 21:45:05,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,346 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-01-07 21:45:05,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:05,389 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-01-07 21:45:05,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-07 21:45:05,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,425 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:45:05,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, 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-01-07 21:45:05,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:05,468 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-01-07 21:45:05,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-01-07 21:45:05,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,506 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-01-07 21:45:05,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:05,549 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-01-07 21:45:05,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-01-07 21:45:05,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,589 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:45:05,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:05,591 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-01-07 21:45:05,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:05,639 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-01-07 21:45:05,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-07 21:45:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:45:05,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:45:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:45:05,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:45:05,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-07 21:45:05,732 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:45:05,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:45:05,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:45:05,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:45:05,733 INFO L87 Difference]: Start difference. First operand 2639 states and 18434 transitions. Second operand 12 states. [2019-01-07 21:45:09,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:45:09,469 INFO L93 Difference]: Finished difference Result 3636 states and 24951 transitions. [2019-01-07 21:45:09,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-07 21:45:09,469 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:45:09,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:45:09,481 INFO L225 Difference]: With dead ends: 3636 [2019-01-07 21:45:09,481 INFO L226 Difference]: Without dead ends: 3626 [2019-01-07 21:45:09,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:45:09,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-01-07 21:45:12,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 2790. [2019-01-07 21:45:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-01-07 21:45:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 19490 transitions. [2019-01-07 21:45:12,177 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 19490 transitions. Word has length 6 [2019-01-07 21:45:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:45:12,177 INFO L480 AbstractCegarLoop]: Abstraction has 2790 states and 19490 transitions. [2019-01-07 21:45:12,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:45:12,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 19490 transitions. [2019-01-07 21:45:12,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:45:12,181 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:45:12,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:45:12,181 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:45:12,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:45:12,181 INFO L82 PathProgramCache]: Analyzing trace with hash 900752924, now seen corresponding path program 2 times [2019-01-07 21:45:12,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:45:12,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:45:12,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:45:12,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:45:12,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:45:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:45:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:45:12,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:45:12,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:45:12,239 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:45:12,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:45:12,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:45:12,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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:45:12,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:45:12,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:45:12,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:45:12,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:45:12,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:45:12,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:45:12,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:45:12,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,269 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 26 treesize of output 36 [2019-01-07 21:45:12,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,276 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 28 treesize of output 50 [2019-01-07 21:45:12,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:45:12,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:45:12,295 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:12,333 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:12,352 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:12,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:12,381 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:12,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:12,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:45:12,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,436 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 53 treesize of output 63 [2019-01-07 21:45:12,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:45:12,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:45:12,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-07 21:45:12,592 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:12,615 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:12,637 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:12,659 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:12,684 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:12,725 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-01-07 21:45:12,725 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-07 21:45:12,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,749 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 41 treesize of output 93 [2019-01-07 21:45:12,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:12,791 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-01-07 21:45:12,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-07 21:45:12,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:12,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 111 [2019-01-07 21:45:12,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:45:12,972 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-01-07 21:45:12,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:98 [2019-01-07 21:45:13,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:13,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:13,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:13,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:13,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:13,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:13,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:13,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:13,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:13,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:13,056 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:45:13,057 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-07 21:45:13,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:13,090 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-01-07 21:45:13,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:36 [2019-01-07 21:45:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:45:13,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:45:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:45:13,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:45:13,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:45:13,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:45:13,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:45:13,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:45:13,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:45:13,164 INFO L87 Difference]: Start difference. First operand 2790 states and 19490 transitions. Second operand 10 states. [2019-01-07 21:45:17,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:45:17,471 INFO L93 Difference]: Finished difference Result 4300 states and 29900 transitions. [2019-01-07 21:45:17,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:45:17,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:45:17,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:45:17,485 INFO L225 Difference]: With dead ends: 4300 [2019-01-07 21:45:17,485 INFO L226 Difference]: Without dead ends: 4298 [2019-01-07 21:45:17,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:45:17,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2019-01-07 21:45:21,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4076. [2019-01-07 21:45:21,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2019-01-07 21:45:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 28660 transitions. [2019-01-07 21:45:21,462 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 28660 transitions. Word has length 6 [2019-01-07 21:45:21,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:45:21,462 INFO L480 AbstractCegarLoop]: Abstraction has 4076 states and 28660 transitions. [2019-01-07 21:45:21,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:45:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 28660 transitions. [2019-01-07 21:45:21,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:45:21,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:45:21,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:45:21,468 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:45:21,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:45:21,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2030611754, now seen corresponding path program 1 times [2019-01-07 21:45:21,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:45:21,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:45:21,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:45:21,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:45:21,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:45:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:45:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:45:21,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:45:21,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:45:21,532 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:45:21,533 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [28], [29] [2019-01-07 21:45:21,533 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:45:21,533 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:45:21,535 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:45:21,536 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-01-07 21:45:21,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:45:21,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:45:21,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:45:21,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:45:21,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:45:21,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:45:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:45:21,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:45:21,571 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 21 treesize of output 24 [2019-01-07 21:45:21,574 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 24 treesize of output 30 [2019-01-07 21:45:21,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,577 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 26 treesize of output 40 [2019-01-07 21:45:21,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:45:21,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,589 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 30 treesize of output 72 [2019-01-07 21:45:21,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45: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, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:45:21,598 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:21,635 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:21,658 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:21,674 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:21,688 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:21,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:21,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,733 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-01-07 21:45:21,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,770 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-01-07 21:45:21,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,813 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-01-07 21:45:21,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,868 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-01-07 21:45:21,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:21,935 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-01-07 21:45:21,935 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:21,974 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:21,998 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,023 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,047 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:45:22,089 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-07 21:45:22,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,131 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-01-07 21:45:22,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,172 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-01-07 21:45:22,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-07 21:45:22,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,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, 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-01-07 21:45:22,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,259 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-01-07 21:45:22,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-07 21:45:22,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,307 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:45:22,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, 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-01-07 21:45:22,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,356 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-01-07 21:45:22,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-07 21:45:22,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,403 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:45:22,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,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, 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-01-07 21:45:22,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,451 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-01-07 21:45:22,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-07 21:45:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:45:22,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:45:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:45:22,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:45:22,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-07 21:45:22,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:45:22,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:45:22,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:45:22,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:45:22,553 INFO L87 Difference]: Start difference. First operand 4076 states and 28660 transitions. Second operand 11 states. [2019-01-07 21:45:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:45:27,347 INFO L93 Difference]: Finished difference Result 4236 states and 29539 transitions. [2019-01-07 21:45:27,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:45:27,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-07 21:45:27,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:45:27,360 INFO L225 Difference]: With dead ends: 4236 [2019-01-07 21:45:27,360 INFO L226 Difference]: Without dead ends: 4233 [2019-01-07 21:45:27,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:45:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-01-07 21:45:31,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 4163. [2019-01-07 21:45:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-01-07 21:45:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 29269 transitions. [2019-01-07 21:45:31,360 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 29269 transitions. Word has length 7 [2019-01-07 21:45:31,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:45:31,361 INFO L480 AbstractCegarLoop]: Abstraction has 4163 states and 29269 transitions. [2019-01-07 21:45:31,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:45:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 29269 transitions. [2019-01-07 21:45:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:45:31,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:45:31,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:45:31,366 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:45:31,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:45:31,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2030621364, now seen corresponding path program 1 times [2019-01-07 21:45:31,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:45:31,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:45:31,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:45:31,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:45:31,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:45:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:45:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:45:31,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:45:31,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:45:31,455 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:45:31,456 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [22], [28], [29] [2019-01-07 21:45:31,456 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:45:31,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:45:31,458 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:45:31,458 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-01-07 21:45:31,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:45:31,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:45:31,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:45:31,459 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:45:31,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:45:31,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:45:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:45:31,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:45:31,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:31,490 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 48 treesize of output 54 [2019-01-07 21:45:31,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:31,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:31,522 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 41 treesize of output 53 [2019-01-07 21:45:31,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:31,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:31,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:31,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:31,558 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 32 treesize of output 61 [2019-01-07 21:45:31,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:31,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:31,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:31,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:31,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:31,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:31,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:45:31,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:31,629 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:31,644 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:31,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:31,683 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 21 treesize of output 24 [2019-01-07 21:45:31,685 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 24 treesize of output 30 [2019-01-07 21:45:31,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:45:31,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:45:31,695 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 30 treesize of output 72 [2019-01-07 21:45:31,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:45:31,704 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:31,727 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:31,746 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:31,761 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:31,772 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:31,783 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:31,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:45:31,814 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-01-07 21:45:31,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:31,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:45:31,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:31,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:45:31,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-07 21:45:32,062 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-07 21:45:32,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,072 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-07 21:45:32,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:32,105 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-01-07 21:45:32,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-07 21:45:32,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,143 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:45:32,144 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-07 21:45:32,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:32,176 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-01-07 21:45:32,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-07 21:45:32,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:32,211 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:45:32,212 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-07 21:45:32,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:32,246 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-01-07 21:45:32,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-07 21:45:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:45:32,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:45:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:45:32,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:45:32,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:45:32,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:45:32,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:45:32,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:45:32,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:45:32,350 INFO L87 Difference]: Start difference. First operand 4163 states and 29269 transitions. Second operand 12 states. [2019-01-07 21:45:36,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:45:36,769 INFO L93 Difference]: Finished difference Result 4232 states and 29577 transitions. [2019-01-07 21:45:36,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:45:36,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-07 21:45:36,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:45:36,782 INFO L225 Difference]: With dead ends: 4232 [2019-01-07 21:45:36,783 INFO L226 Difference]: Without dead ends: 4231 [2019-01-07 21:45:36,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-01-07 21:45:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2019-01-07 21:45:40,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 4190. [2019-01-07 21:45:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-01-07 21:45:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 29458 transitions. [2019-01-07 21:45:40,885 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 29458 transitions. Word has length 7 [2019-01-07 21:45:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:45:40,885 INFO L480 AbstractCegarLoop]: Abstraction has 4190 states and 29458 transitions. [2019-01-07 21:45:40,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:45:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 29458 transitions. [2019-01-07 21:45:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:45:40,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:45:40,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:45:40,891 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:45:40,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:45:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash -2030548264, now seen corresponding path program 1 times [2019-01-07 21:45:40,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:45:40,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:45:40,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:45:40,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:45:40,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:45:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:45:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:45:41,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:45:41,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:45:41,034 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:45:41,034 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [30], [31] [2019-01-07 21:45:41,035 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:45:41,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:45:41,036 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:45:41,037 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-01-07 21:45:41,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:45:41,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:45:41,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:45:41,037 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:45:41,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:45:41,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:45:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:45:41,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:45:41,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:45:41,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,077 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 53 treesize of output 63 [2019-01-07 21:45:41,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:45:41,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:45:41,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-07 21:45:41,244 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:41,270 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:41,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:41,327 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:41,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:41,392 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 21 treesize of output 24 [2019-01-07 21:45:41,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:45:41,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-07 21:45:41,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-07 21:45:41,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:45:41,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:45:41,442 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:41,473 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:41,490 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:41,504 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:41,515 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:41,526 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:41,566 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-01-07 21:45:41,567 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-07 21:45:41,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,603 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 41 treesize of output 87 [2019-01-07 21:45:41,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:41,642 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-01-07 21:45:41,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-07 21:45:41,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,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, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 113 [2019-01-07 21:45:41,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:45:41,851 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-01-07 21:45:41,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:98 [2019-01-07 21:45:41,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,918 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:45:41,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:41,919 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-07 21:45:41,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:41,953 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-01-07 21:45:41,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-07 21:45:41,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:45:41,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:45:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:45:42,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:45:42,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:45:42,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:45:42,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:45:42,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:45:42,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:45:42,038 INFO L87 Difference]: Start difference. First operand 4190 states and 29458 transitions. Second operand 10 states. [2019-01-07 21:45:46,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:45:46,664 INFO L93 Difference]: Finished difference Result 4570 states and 31903 transitions. [2019-01-07 21:45:46,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:45:46,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:45:46,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:45:46,679 INFO L225 Difference]: With dead ends: 4570 [2019-01-07 21:45:46,679 INFO L226 Difference]: Without dead ends: 4569 [2019-01-07 21:45:46,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:45:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2019-01-07 21:45:50,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 4419. [2019-01-07 21:45:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4419 states. [2019-01-07 21:45:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 31072 transitions. [2019-01-07 21:45:50,854 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 31072 transitions. Word has length 7 [2019-01-07 21:45:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:45:50,854 INFO L480 AbstractCegarLoop]: Abstraction has 4419 states and 31072 transitions. [2019-01-07 21:45:50,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:45:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 31072 transitions. [2019-01-07 21:45:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:45:50,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:45:50,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:45:50,861 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:45:50,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:45:50,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2030561782, now seen corresponding path program 1 times [2019-01-07 21:45:50,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:45:50,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:45:50,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:45:50,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:45:50,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:45:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:45:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:45:51,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:45:51,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:45:51,070 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:45:51,070 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [28], [29] [2019-01-07 21:45:51,071 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:45:51,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:45:51,072 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:45:51,072 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-01-07 21:45:51,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:45:51,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:45:51,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:45:51,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:45:51,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:45:51,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:45:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:45:51,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:45:51,108 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 21 treesize of output 24 [2019-01-07 21:45:51,110 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 24 treesize of output 30 [2019-01-07 21:45:51,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,114 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 26 treesize of output 40 [2019-01-07 21:45:51,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,120 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 28 treesize of output 54 [2019-01-07 21:45:51,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,127 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 30 treesize of output 72 [2019-01-07 21:45:51,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,135 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:45:51,136 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:51,173 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:51,195 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:51,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:51,225 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:51,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:51,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,270 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-01-07 21:45:51,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,308 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-01-07 21:45:51,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,351 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-01-07 21:45:51,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,405 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-01-07 21:45:51,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,474 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-01-07 21:45:51,474 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:51,499 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:51,521 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:51,545 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:51,570 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:51,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:45:51,613 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-07 21:45:51,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,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, 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-01-07 21:45:51,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:51,698 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-01-07 21:45:51,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-07 21:45:51,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,741 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-01-07 21:45:51,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:51,787 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-01-07 21:45:51,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-07 21:45:51,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,840 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:45:51,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:51,842 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-01-07 21:45:51,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:52,142 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-01-07 21:45:52,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-07 21:45:52,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:52,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:52,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:52,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:52,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:52,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:52,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:52,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:52,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:52,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:52,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:52,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:52,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:52,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:52,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:52,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:52,189 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:45:52,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, 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 131 [2019-01-07 21:45:52,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:52,241 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-01-07 21:45:52,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-01-07 21:45:52,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:45:52,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:45:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:45:52,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:45:52,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-07 21:45:52,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:45:52,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:45:52,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:45:52,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:45:52,373 INFO L87 Difference]: Start difference. First operand 4419 states and 31072 transitions. Second operand 12 states. [2019-01-07 21:45:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:45:59,021 INFO L93 Difference]: Finished difference Result 5928 states and 41521 transitions. [2019-01-07 21:45:59,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:45:59,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-07 21:45:59,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:45:59,039 INFO L225 Difference]: With dead ends: 5928 [2019-01-07 21:45:59,039 INFO L226 Difference]: Without dead ends: 5927 [2019-01-07 21:45:59,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-01-07 21:45:59,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2019-01-07 21:46:04,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 5628. [2019-01-07 21:46:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5628 states. [2019-01-07 21:46:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5628 states to 5628 states and 39710 transitions. [2019-01-07 21:46:04,728 INFO L78 Accepts]: Start accepts. Automaton has 5628 states and 39710 transitions. Word has length 7 [2019-01-07 21:46:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:46:04,728 INFO L480 AbstractCegarLoop]: Abstraction has 5628 states and 39710 transitions. [2019-01-07 21:46:04,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:46:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 5628 states and 39710 transitions. [2019-01-07 21:46:04,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:46:04,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:46:04,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:46:04,736 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:46:04,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:46:04,736 INFO L82 PathProgramCache]: Analyzing trace with hash -2030965338, now seen corresponding path program 1 times [2019-01-07 21:46:04,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:46:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:46:04,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:46:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:46:04,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:46:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:46:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:46:04,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:46:04,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:46:04,846 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:46:04,846 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [30], [31] [2019-01-07 21:46:04,847 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:46:04,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:46:04,848 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:46:04,848 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-01-07 21:46:04,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:46:04,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:46:04,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:46:04,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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:46:04,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:46:04,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:46:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:46:04,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:46:04,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:46:04,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:46:04,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:04,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:04,873 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 26 treesize of output 36 [2019-01-07 21:46:04,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:04,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:04,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:04,881 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 28 treesize of output 50 [2019-01-07 21:46:04,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:04,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:04,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:04,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:04,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:46:04,897 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-07 21:46:04,898 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:46:04,922 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:04,941 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:04,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:04,969 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:04,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:05,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-07 21:46:05,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,018 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 36 treesize of output 49 [2019-01-07 21:46:05,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-07 21:46:05,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-07 21:46:05,096 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:46:05,110 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:05,123 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:05,138 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:05,167 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-01-07 21:46:05,167 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-07 21:46:05,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-07 21:46:05,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:46:05,240 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-01-07 21:46:05,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-07 21:46:05,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-07 21:46:05,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:46:05,374 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-01-07 21:46:05,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-01-07 21:46:05,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,424 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:46:05,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 101 [2019-01-07 21:46:05,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:46:05,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:05,489 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:46:05,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-07 21:46:05,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:46:05,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-07 21:46:05,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-07 21:46:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:46:05,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:46:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:46:05,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:46:05,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-07 21:46:05,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:46:05,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:46:05,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:46:05,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:46:05,639 INFO L87 Difference]: Start difference. First operand 5628 states and 39710 transitions. Second operand 11 states. [2019-01-07 21:46:13,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:46:13,179 INFO L93 Difference]: Finished difference Result 6511 states and 45570 transitions. [2019-01-07 21:46:13,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:46:13,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-07 21:46:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:46:13,200 INFO L225 Difference]: With dead ends: 6511 [2019-01-07 21:46:13,201 INFO L226 Difference]: Without dead ends: 6510 [2019-01-07 21:46:13,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:46:13,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-01-07 21:46:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6405. [2019-01-07 21:46:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6405 states. [2019-01-07 21:46:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 45149 transitions. [2019-01-07 21:46:20,607 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 45149 transitions. Word has length 7 [2019-01-07 21:46:20,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:46:20,608 INFO L480 AbstractCegarLoop]: Abstraction has 6405 states and 45149 transitions. [2019-01-07 21:46:20,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:46:20,608 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 45149 transitions. [2019-01-07 21:46:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:46:20,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:46:20,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:46:20,615 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:46:20,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:46:20,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2015785446, now seen corresponding path program 1 times [2019-01-07 21:46:20,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:46:20,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:46:20,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:46:20,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:46:20,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:46:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:46:21,057 WARN L181 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-07 21:46:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:46:21,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:46:21,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:46:21,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:46:21,239 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [28], [29] [2019-01-07 21:46:21,239 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:46:21,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:46:21,241 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:46:21,241 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-01-07 21:46:21,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:46:21,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:46:21,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:46:21,241 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:46:21,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:46:21,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:46:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:46:21,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:46:21,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:46:21,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-07 21:46:21,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:46:21,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:46:21,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-07 21:46:21,429 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:46:21,453 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:21,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:21,500 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:21,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:21,558 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 21 treesize of output 24 [2019-01-07 21:46:21,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:46:21,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-07 21:46:21,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-07 21:46:21,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:46:21,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:46:21,578 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:46:21,609 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:21,627 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:21,641 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:21,652 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:21,663 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:21,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:46:21,703 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:84, output treesize:87 [2019-01-07 21:46:21,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,772 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:46:21,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:46:21,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:46:21,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-07 21:46:21,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,837 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-07 21:46:21,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:46:21,865 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-01-07 21:46:21,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-07 21:46:21,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,904 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:46:21,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,905 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-07 21:46:21,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:46:21,936 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-01-07 21:46:21,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-07 21:46:21,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:21,977 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:46:21,978 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-07 21:46:21,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:46:22,012 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-01-07 21:46:22,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:46:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:46:22,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:46:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:46:22,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:46:22,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-07 21:46:22,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:46:22,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-07 21:46:22,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-07 21:46:22,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:46:22,129 INFO L87 Difference]: Start difference. First operand 6405 states and 45149 transitions. Second operand 13 states. [2019-01-07 21:46:31,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:46:31,516 INFO L93 Difference]: Finished difference Result 7179 states and 50083 transitions. [2019-01-07 21:46:31,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-07 21:46:31,517 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-07 21:46:31,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:46:31,542 INFO L225 Difference]: With dead ends: 7179 [2019-01-07 21:46:31,543 INFO L226 Difference]: Without dead ends: 7170 [2019-01-07 21:46:31,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-01-07 21:46:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2019-01-07 21:46:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 6542. [2019-01-07 21:46:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-01-07 21:46:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 46140 transitions. [2019-01-07 21:46:39,155 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 46140 transitions. Word has length 7 [2019-01-07 21:46:39,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:46:39,155 INFO L480 AbstractCegarLoop]: Abstraction has 6542 states and 46140 transitions. [2019-01-07 21:46:39,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-07 21:46:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 46140 transitions. [2019-01-07 21:46:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:46:39,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:46:39,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:46:39,162 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:46:39,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:46:39,163 INFO L82 PathProgramCache]: Analyzing trace with hash -2015650778, now seen corresponding path program 1 times [2019-01-07 21:46:39,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:46:39,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:46:39,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:46:39,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:46:39,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:46:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:46:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:46:39,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:46:39,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:46:39,204 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:46:39,204 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [30], [32], [33] [2019-01-07 21:46:39,205 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:46:39,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:46:39,207 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:46:39,208 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-01-07 21:46:39,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:46:39,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:46:39,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:46:39,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:46:39,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:46:39,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:46:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:46:39,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:46:39,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2019-01-07 21:46:39,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-07 21:46:39,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2019-01-07 21:46:39,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:39,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:39,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:39,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:39,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2019-01-07 21:46:39,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:39,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:39,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:39,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:39,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:39,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:39,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:39,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:39,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2019-01-07 21:46:39,313 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:46:39,327 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:39,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:39,359 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:39,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:39,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:46:39,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:46:39,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-07 21:46:39,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-01-07 21:46:39,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-01-07 21:46:39,432 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-07 21:46:39,432 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:46:39,456 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:39,468 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:39,477 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:39,486 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:39,497 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:46:39,526 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-01-07 21:46:39,526 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:59, output treesize:67 [2019-01-07 21:46:39,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:39,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, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 79 [2019-01-07 21:46:39,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-07 21:46:39,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 8 xjuncts. [2019-01-07 21:46:39,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:333 [2019-01-07 21:46:39,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:39,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:39,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:39,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:46:39,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-07 21:46:39,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:46:39,914 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-01-07 21:46:39,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-07 21:46:39,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:46:39,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:46:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:46:39,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:46:39,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 21:46:39,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:46:39,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:46:39,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:46:39,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:46:39,960 INFO L87 Difference]: Start difference. First operand 6542 states and 46140 transitions. Second operand 8 states. [2019-01-07 21:46:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:46:50,579 INFO L93 Difference]: Finished difference Result 10441 states and 73753 transitions. [2019-01-07 21:46:50,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:46:50,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-07 21:46:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:46:50,613 INFO L225 Difference]: With dead ends: 10441 [2019-01-07 21:46:50,613 INFO L226 Difference]: Without dead ends: 10440 [2019-01-07 21:46:50,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 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-01-07 21:46:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10440 states. [2019-01-07 21:47:01,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10440 to 10397. [2019-01-07 21:47:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10397 states. [2019-01-07 21:47:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10397 states to 10397 states and 73709 transitions. [2019-01-07 21:47:01,863 INFO L78 Accepts]: Start accepts. Automaton has 10397 states and 73709 transitions. Word has length 7 [2019-01-07 21:47:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:47:01,863 INFO L480 AbstractCegarLoop]: Abstraction has 10397 states and 73709 transitions. [2019-01-07 21:47:01,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:47:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 10397 states and 73709 transitions. [2019-01-07 21:47:01,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:47:01,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:47:01,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:47:01,873 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:47:01,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:47:01,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2014341960, now seen corresponding path program 1 times [2019-01-07 21:47:01,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:47:01,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:47:01,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:47:01,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:47:01,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:47:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:47:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:47:01,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:47:01,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:47:01,969 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:47:01,970 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [28], [30], [31] [2019-01-07 21:47:01,970 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:47:01,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:47:01,972 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:47:01,972 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-01-07 21:47:01,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:47:01,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:47:01,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:47:01,973 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:47:01,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:47:01,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:47:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:47:01,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:47:01,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:47:01,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:47:01,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:01,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:01,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-07 21:47:02,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,007 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 28 treesize of output 50 [2019-01-07 21:47:02,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:47:02,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:47:02,027 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:47:02,062 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:02,082 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:02,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:02,110 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:02,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:02,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:47:02,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-07 21:47:02,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:47:02,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:47:02,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-07 21:47:02,319 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:47:02,342 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:02,364 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:02,387 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:02,412 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:02,452 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-01-07 21:47:02,452 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-07 21:47:02,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,482 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 41 treesize of output 87 [2019-01-07 21:47:02,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:47:02,521 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-01-07 21:47:02,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-07 21:47:02,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,554 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:47:02,555 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 43 treesize of output 102 [2019-01-07 21:47:02,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:47:02,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-01-07 21:47:02,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:55 [2019-01-07 21:47:02,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:02,636 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:47:02,645 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 2 case distinctions, treesize of input 45 treesize of output 108 [2019-01-07 21:47:02,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:47:02,778 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-01-07 21:47:02,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:102 [2019-01-07 21:47:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:47:02,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:47:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:47:02,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:47:02,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:47:02,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:47:02,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:47:02,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:47:02,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:47:02,882 INFO L87 Difference]: Start difference. First operand 10397 states and 73709 transitions. Second operand 10 states. [2019-01-07 21:47:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:47:17,724 INFO L93 Difference]: Finished difference Result 10427 states and 73743 transitions. [2019-01-07 21:47:17,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:47:17,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:47:17,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:47:17,760 INFO L225 Difference]: With dead ends: 10427 [2019-01-07 21:47:17,761 INFO L226 Difference]: Without dead ends: 10426 [2019-01-07 21:47:17,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=100, Invalid=171, Unknown=1, NotChecked=0, Total=272 [2019-01-07 21:47:17,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10426 states. [2019-01-07 21:47:29,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10426 to 10394. [2019-01-07 21:47:29,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10394 states. [2019-01-07 21:47:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10394 states to 10394 states and 73688 transitions. [2019-01-07 21:47:29,090 INFO L78 Accepts]: Start accepts. Automaton has 10394 states and 73688 transitions. Word has length 7 [2019-01-07 21:47:29,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:47:29,091 INFO L480 AbstractCegarLoop]: Abstraction has 10394 states and 73688 transitions. [2019-01-07 21:47:29,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:47:29,091 INFO L276 IsEmpty]: Start isEmpty. Operand 10394 states and 73688 transitions. [2019-01-07 21:47:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:47:29,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:47:29,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:47:29,101 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:47:29,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:47:29,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2026927280, now seen corresponding path program 1 times [2019-01-07 21:47:29,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:47:29,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:47:29,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:47:29,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:47:29,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:47:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:47:29,246 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-07 21:47:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:47:29,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:47:29,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:47:29,277 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:47:29,277 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [28], [29] [2019-01-07 21:47:29,278 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:47:29,278 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:47:29,279 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:47:29,279 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-01-07 21:47:29,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:47:29,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:47:29,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:47:29,280 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:47:29,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:47:29,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:47:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:47:29,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:47:29,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:47:29,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:47:29,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,309 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 26 treesize of output 36 [2019-01-07 21:47:29,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,317 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 28 treesize of output 50 [2019-01-07 21:47:29,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:47:29,332 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-07 21:47:29,333 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:47:29,358 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:29,378 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:29,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:29,406 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:29,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:29,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-07 21:47:29,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,455 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 36 treesize of output 49 [2019-01-07 21:47:29,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-07 21:47:29,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-07 21:47:29,533 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:47:29,547 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:29,560 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:29,575 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:29,604 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-01-07 21:47:29,604 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-07 21:47:29,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-07 21:47:29,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:47:29,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:47:29,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-07 21:47:29,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,694 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:47:29,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-07 21:47:29,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:47:29,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:47:29,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-07 21:47:29,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-07 21:47:29,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:47:29,758 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-01-07 21:47:29,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-07 21:47:29,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:29,788 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:47:29,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-07 21:47:29,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:47:29,811 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-01-07 21:47:29,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-07 21:47:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:47:29,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:47:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:47:29,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:47:29,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:47:29,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:47:29,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:47:29,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:47:29,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:47:29,911 INFO L87 Difference]: Start difference. First operand 10394 states and 73688 transitions. Second operand 12 states. [2019-01-07 21:47:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:47:41,771 INFO L93 Difference]: Finished difference Result 11408 states and 80747 transitions. [2019-01-07 21:47:41,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:47:41,772 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-07 21:47:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:47:41,810 INFO L225 Difference]: With dead ends: 11408 [2019-01-07 21:47:41,810 INFO L226 Difference]: Without dead ends: 11406 [2019-01-07 21:47:41,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:47:41,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11406 states. [2019-01-07 21:47:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11406 to 11270. [2019-01-07 21:47:53,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-01-07 21:47:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 80138 transitions. [2019-01-07 21:47:53,780 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 80138 transitions. Word has length 7 [2019-01-07 21:47:53,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:47:53,781 INFO L480 AbstractCegarLoop]: Abstraction has 11270 states and 80138 transitions. [2019-01-07 21:47:53,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:47:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 80138 transitions. [2019-01-07 21:47:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:47:53,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:47:53,791 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-07 21:47:53,791 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:47:53,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:47:53,792 INFO L82 PathProgramCache]: Analyzing trace with hash -2023700554, now seen corresponding path program 2 times [2019-01-07 21:47:53,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:47:53,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:47:53,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:47:53,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:47:53,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:47:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:47:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:47:53,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:47:53,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:47:53,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:47:53,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:47:53,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:47:53,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:47:53,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:47:53,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:47:53,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-07 21:47:53,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:47:53,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:47:54,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 21 treesize of output 24 [2019-01-07 21:47:54,015 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 24 treesize of output 30 [2019-01-07 21:47:54,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,075 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 26 treesize of output 40 [2019-01-07 21:47:54,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,146 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 28 treesize of output 54 [2019-01-07 21:47:54,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,253 INFO L303 Elim1Store]: Index analysis took 105 ms [2019-01-07 21:47:54,253 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 30 treesize of output 72 [2019-01-07 21:47:54,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,357 INFO L303 Elim1Store]: Index analysis took 102 ms [2019-01-07 21:47:54,358 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:47:54,358 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:47:54,398 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:54,420 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:54,438 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:54,452 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:54,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:54,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,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, 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-01-07 21:47:54,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,533 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-01-07 21:47:54,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,578 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-01-07 21:47:54,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,632 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-01-07 21:47:54,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,698 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-01-07 21:47:54,699 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:47:54,723 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:54,747 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:54,772 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:54,797 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:47:54,840 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-01-07 21:47:54,840 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-07 21:47:54,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,878 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-01-07 21:47:54,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:47:54,919 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-01-07 21:47:54,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-07 21:47:54,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:54,957 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-01-07 21:47:54,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:47:55,003 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-01-07 21:47:55,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-07 21:47:55,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,125 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:47:55,125 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-01-07 21:47:55,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:47:55,174 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-01-07 21:47:55,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:49 [2019-01-07 21:47:55,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,214 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:47:55,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,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 122 [2019-01-07 21:47:55,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:47:55,264 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-01-07 21:47:55,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:43 [2019-01-07 21:47:55,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:47:55,312 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 45 treesize of output 125 [2019-01-07 21:47:55,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:47:55,360 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-01-07 21:47:55,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:41 [2019-01-07 21:47:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:47:55,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:47:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:47:55,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:47:55,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-07 21:47:55,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:47:55,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-07 21:47:55,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-07 21:47:55,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:47:55,479 INFO L87 Difference]: Start difference. First operand 11270 states and 80138 transitions. Second operand 13 states. [2019-01-07 21:48:11,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:48:11,354 INFO L93 Difference]: Finished difference Result 14692 states and 103813 transitions. [2019-01-07 21:48:11,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-07 21:48:11,355 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-07 21:48:11,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:48:11,409 INFO L225 Difference]: With dead ends: 14692 [2019-01-07 21:48:11,409 INFO L226 Difference]: Without dead ends: 14688 [2019-01-07 21:48:11,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:48:11,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14688 states. [2019-01-07 21:48:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14688 to 12758. [2019-01-07 21:48:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12758 states. [2019-01-07 21:48:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12758 states to 12758 states and 90546 transitions. [2019-01-07 21:48:25,828 INFO L78 Accepts]: Start accepts. Automaton has 12758 states and 90546 transitions. Word has length 7 [2019-01-07 21:48:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:48:25,828 INFO L480 AbstractCegarLoop]: Abstraction has 12758 states and 90546 transitions. [2019-01-07 21:48:25,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-07 21:48:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 12758 states and 90546 transitions. [2019-01-07 21:48:25,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:48:25,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:48:25,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:48:25,839 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:48:25,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:48:25,839 INFO L82 PathProgramCache]: Analyzing trace with hash -2023160096, now seen corresponding path program 1 times [2019-01-07 21:48:25,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:48:25,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:48:25,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:48:25,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:48:25,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:48:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:48:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:48:25,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:48:25,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:48:25,880 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:48:25,880 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [28], [30], [31] [2019-01-07 21:48:25,880 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:48:25,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:48:25,882 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:48:25,882 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-01-07 21:48:25,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:48:25,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:48:25,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:48:25,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:48:25,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:48:25,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:48:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:48:25,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:48:25,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:48:25,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:48:25,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:25,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:25,924 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 26 treesize of output 36 [2019-01-07 21:48:25,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:25,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:25,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:25,932 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 28 treesize of output 50 [2019-01-07 21:48:25,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:25,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:25,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:25,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:25,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:48:25,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:25,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:25,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:25,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:25,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:25,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:48:25,953 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:48:25,989 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:48:26,008 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:48:26,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:48:26,037 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:48:26,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:48:26,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:48:26,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,092 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 53 treesize of output 63 [2019-01-07 21:48:26,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:48:26,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:48:26,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-07 21:48:26,248 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:48:26,270 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:48:26,293 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:48:26,315 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:48:26,340 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:48:26,380 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-01-07 21:48:26,381 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-07 21:48:26,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,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, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-07 21:48:26,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:48:26,448 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-01-07 21:48:26,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-07 21:48:26,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 109 [2019-01-07 21:48:26,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:48:26,524 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-01-07 21:48:26,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-07 21:48:26,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,621 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:48:26,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:26,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 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-01-07 21:48:26,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:48:26,668 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-01-07 21:48:26,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-01-07 21:48:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:48:26,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:48:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:48:26,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:48:26,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:48:26,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:48:26,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:48:26,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:48:26,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:48:26,739 INFO L87 Difference]: Start difference. First operand 12758 states and 90546 transitions. Second operand 10 states. [2019-01-07 21:48:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:48:40,913 INFO L93 Difference]: Finished difference Result 13016 states and 92075 transitions. [2019-01-07 21:48:40,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:48:40,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:48:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:48:40,965 INFO L225 Difference]: With dead ends: 13016 [2019-01-07 21:48:40,965 INFO L226 Difference]: Without dead ends: 13015 [2019-01-07 21:48:40,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:48:40,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13015 states. [2019-01-07 21:48:55,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13015 to 12958. [2019-01-07 21:48:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-01-07 21:48:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-01-07 21:48:55,469 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-01-07 21:48:55,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:48:55,469 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-01-07 21:48:55,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:48:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-01-07 21:48:55,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:48:55,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:48:55,481 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-07 21:48:55,481 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:48:55,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:48:55,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1920990370, now seen corresponding path program 1 times [2019-01-07 21:48:55,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:48:55,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:48:55,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:48:55,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:48:55,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:48:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:48:55,726 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-01-07 21:48:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:48:55,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:48:55,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:48:55,736 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:48:55,736 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [30], [32], [33] [2019-01-07 21:48:55,737 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:48:55,737 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:48:55,739 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:48:55,739 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-01-07 21:48:55,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:48:55,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:48:55,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:48:55,740 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:48:55,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:48:55,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:48:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:48:55,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:48:55,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:48:55,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:48:55,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,768 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 26 treesize of output 36 [2019-01-07 21:48:55,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,776 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 28 treesize of output 50 [2019-01-07 21:48:55,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:48:55,792 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-07 21:48:55,792 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:48:55,816 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:48:55,835 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:48:55,851 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:48:55,863 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:48:55,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:48:55,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-07 21:48:55,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,912 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 36 treesize of output 49 [2019-01-07 21:48:55,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-07 21:48:55,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:55,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-07 21:48:55,989 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:48:56,004 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:48:56,016 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:48:56,031 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:48:56,059 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-01-07 21:48:56,060 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-07 21:48:56,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:56,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:48:56,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:48:56,186 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-01-07 21:48:56,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-07 21:48:58,024 WARN L181 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-01-07 21:48:58,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:58,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:58,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:58,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:58,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:58,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:48:58,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-07 21:48:58,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:48:58,055 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-01-07 21:48:58,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 [2019-01-07 21:48:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:48:58,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:48: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-01-07 21:48:58,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:48:58,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-07 21:48:58,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:48:58,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 21:48:58,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 21:48:58,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:48:58,105 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 7 states. [2019-01-07 21:49:11,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:49:11,729 INFO L93 Difference]: Finished difference Result 12974 states and 91967 transitions. [2019-01-07 21:49:11,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:49:11,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-07 21:49:11,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:49:11,778 INFO L225 Difference]: With dead ends: 12974 [2019-01-07 21:49:11,778 INFO L226 Difference]: Without dead ends: 12973 [2019-01-07 21:49:11,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:49:11,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12973 states. [2019-01-07 21:49:26,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12973 to 12958. [2019-01-07 21:49:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-01-07 21:49:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-01-07 21:49:26,137 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-01-07 21:49:26,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:49:26,137 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-01-07 21:49:26,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 21:49:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-01-07 21:49:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:49:26,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:49:26,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:49:26,148 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:49:26,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:49:26,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1935645556, now seen corresponding path program 1 times [2019-01-07 21:49:26,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:49:26,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:49:26,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:49:26,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:49:26,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:49:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:49:26,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:49:26,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:49:26,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:49:26,197 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:49:26,197 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [30], [31] [2019-01-07 21:49:26,198 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:49:26,198 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:49:26,200 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:49:26,200 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-01-07 21:49:26,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:49:26,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:49:26,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:49:26,201 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:49:26,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:49:26,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:49:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:49:26,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:49:26,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:49:26,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:49:26,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,228 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 26 treesize of output 36 [2019-01-07 21:49:26,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,236 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 28 treesize of output 50 [2019-01-07 21:49:26,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:49:26,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:49:26,253 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:49:26,289 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:26,308 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:26,324 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:26,336 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:26,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:49:26,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,392 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 53 treesize of output 63 [2019-01-07 21:49:26,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:49:26,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:49:26,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-07 21:49:26,549 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:49:26,572 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:26,594 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:26,617 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:26,648 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:26,688 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-01-07 21:49:26,689 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-07 21:49:26,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:26,731 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 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-07 21:49:26,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:49:26,873 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-01-07 21:49:26,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-01-07 21:49:27,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:27,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:27,128 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:49:27,129 INFO L303 Elim1Store]: Index analysis took 202 ms [2019-01-07 21:49:27,129 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:49:27,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:49:27,165 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-01-07 21:49:27,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-01-07 21:49:27,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:27,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:27,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:27,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:27,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:27,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:27,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:27,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:27,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:27,195 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-07 21:49:27,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:49:27,226 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-01-07 21:49:27,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-01-07 21:49:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:49:27,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:49:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:49:27,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:49:27,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:49:27,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:49:27,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:49:27,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:49:27,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:49:27,302 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 10 states. [2019-01-07 21:49:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:49:41,212 INFO L93 Difference]: Finished difference Result 13106 states and 92752 transitions. [2019-01-07 21:49:41,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:49:41,213 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:49:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:49:41,260 INFO L225 Difference]: With dead ends: 13106 [2019-01-07 21:49:41,260 INFO L226 Difference]: Without dead ends: 13105 [2019-01-07 21:49:41,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:49:41,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-01-07 21:49:55,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 13023. [2019-01-07 21:49:55,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13023 states. [2019-01-07 21:49:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13023 states to 13023 states and 92401 transitions. [2019-01-07 21:49:55,865 INFO L78 Accepts]: Start accepts. Automaton has 13023 states and 92401 transitions. Word has length 7 [2019-01-07 21:49:55,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:49:55,865 INFO L480 AbstractCegarLoop]: Abstraction has 13023 states and 92401 transitions. [2019-01-07 21:49:55,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:49:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 13023 states and 92401 transitions. [2019-01-07 21:49:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:49:55,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:49:55,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:49:55,875 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:49:55,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:49:55,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1935632038, now seen corresponding path program 1 times [2019-01-07 21:49:55,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:49:55,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:49:55,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:49:55,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:49:55,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:49:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:49:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:49:55,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:49:55,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:49:55,952 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:49:55,952 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [24], [28], [29] [2019-01-07 21:49:55,952 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:49:55,953 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:49:55,954 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:49:55,954 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-01-07 21:49:55,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:49:55,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:49:55,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:49:55,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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:49:55,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:49:55,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:49:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:49:55,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:49:55,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 21 treesize of output 24 [2019-01-07 21:49:55,990 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 24 treesize of output 30 [2019-01-07 21:49:55,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:55,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:55,994 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 26 treesize of output 40 [2019-01-07 21:49:55,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:55,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:49:56,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,008 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 30 treesize of output 72 [2019-01-07 21:49:56,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,016 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:49:56,017 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:49:56,056 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:56,077 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:56,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:56,106 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:56,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:56,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,152 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-01-07 21:49:56,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,191 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-01-07 21:49:56,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,233 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-01-07 21:49:56,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,288 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-01-07 21:49:56,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,356 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-01-07 21:49:56,356 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:49:56,381 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:56,405 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:56,429 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:56,454 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:49:56,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:49:56,497 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-07 21:49:56,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,540 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-01-07 21:49:56,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:49:56,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:49:56,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-07 21:49:56,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,649 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:49:56,650 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-01-07 21:49:56,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:49:56,694 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-01-07 21:49:56,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-01-07 21:49:56,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,737 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-01-07 21:49:56,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:49:56,783 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-01-07 21:49:56,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-01-07 21:49:56,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:49:56,831 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:49:56,832 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-01-07 21:49:56,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:49:56,881 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-01-07 21:49:56,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-01-07 21:49:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:49:56,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:49:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:49:56,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:49:56,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:49:56,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:49:56,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:49:56,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:49:56,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:49:56,995 INFO L87 Difference]: Start difference. First operand 13023 states and 92401 transitions. Second operand 12 states. [2019-01-07 21:50:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:50:11,399 INFO L93 Difference]: Finished difference Result 13278 states and 93926 transitions. [2019-01-07 21:50:11,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:50:11,399 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-07 21:50:11,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:50:11,445 INFO L225 Difference]: With dead ends: 13278 [2019-01-07 21:50:11,445 INFO L226 Difference]: Without dead ends: 13277 [2019-01-07 21:50:11,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-01-07 21:50:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2019-01-07 21:50:26,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 13233. [2019-01-07 21:50:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13233 states. [2019-01-07 21:50:26,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13233 states to 13233 states and 93871 transitions. [2019-01-07 21:50:26,367 INFO L78 Accepts]: Start accepts. Automaton has 13233 states and 93871 transitions. Word has length 7 [2019-01-07 21:50:26,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:50:26,367 INFO L480 AbstractCegarLoop]: Abstraction has 13233 states and 93871 transitions. [2019-01-07 21:50:26,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:50:26,367 INFO L276 IsEmpty]: Start isEmpty. Operand 13233 states and 93871 transitions. [2019-01-07 21:50:26,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:50:26,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:50:26,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:50:26,379 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:50:26,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:50:26,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1935214964, now seen corresponding path program 1 times [2019-01-07 21:50:26,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:50:26,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:50:26,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:50:26,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:50:26,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:50:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:50:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:50:26,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:50:26,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:50:26,513 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:50:26,513 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [22], [28], [29] [2019-01-07 21:50:26,514 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:50:26,514 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:50:26,515 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:50:26,515 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-01-07 21:50:26,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:50:26,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:50:26,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:50:26,516 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:50:26,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:50:26,527 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:50:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:50:26,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:50:26,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:50:26,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 30 [2019-01-07 21:50:26,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,562 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 26 treesize of output 40 [2019-01-07 21:50:26,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,570 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 28 treesize of output 54 [2019-01-07 21:50:26,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,578 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 30 treesize of output 72 [2019-01-07 21:50:26,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:50:26,586 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:50:26,613 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:50:26,635 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:50:26,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:50:26,665 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:50:26,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:50:26,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,704 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 48 treesize of output 54 [2019-01-07 21:50:26,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,734 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 41 treesize of output 53 [2019-01-07 21:50:26,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,772 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 32 treesize of output 61 [2019-01-07 21:50:26,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:50:26,819 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:50:26,835 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:50:26,850 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:50:26,865 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:50:26,896 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-01-07 21:50:26,896 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-07 21:50:26,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:26,948 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:50:26,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:50:26,976 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-01-07 21:50:26,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-07 21:50:27,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,008 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:50:27,009 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-07 21:50:27,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:50:27,037 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-01-07 21:50:27,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-07 21:50:27,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,069 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-07 21:50:27,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:50:27,101 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-01-07 21:50:27,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-07 21:50:27,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:27,136 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:50:27,136 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-07 21:50:27,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:50:27,169 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-01-07 21:50:27,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-07 21:50:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:50:27,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:50:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:50:27,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:50:27,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-07 21:50:27,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:50:27,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-07 21:50:27,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-07 21:50:27,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:50:27,267 INFO L87 Difference]: Start difference. First operand 13233 states and 93871 transitions. Second operand 13 states. [2019-01-07 21:50:45,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:50:45,280 INFO L93 Difference]: Finished difference Result 17581 states and 124519 transitions. [2019-01-07 21:50:45,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-07 21:50:45,280 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-07 21:50:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:50:45,348 INFO L225 Difference]: With dead ends: 17581 [2019-01-07 21:50:45,348 INFO L226 Difference]: Without dead ends: 17580 [2019-01-07 21:50:45,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-01-07 21:50:45,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17580 states. [2019-01-07 21:50:56,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17580 to 9927. [2019-01-07 21:50:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-01-07 21:50:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-01-07 21:50:56,965 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-01-07 21:50:56,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:50:56,966 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-01-07 21:50:56,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-07 21:50:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-01-07 21:50:56,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:50:56,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:50:56,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:50:56,974 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:50:56,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:50:56,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1935766706, now seen corresponding path program 1 times [2019-01-07 21:50:56,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:50:56,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:50:56,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:50:56,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:50:56,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:50:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:50:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:50:57,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:50:57,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:50:57,029 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:50:57,029 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [30], [32], [33] [2019-01-07 21:50:57,029 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:50:57,030 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:50:57,031 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:50:57,031 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-01-07 21:50:57,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:50:57,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:50:57,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:50:57,032 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:50:57,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:50:57,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:50:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:50:57,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:50:57,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:50:57,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:50:57,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,060 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 26 treesize of output 36 [2019-01-07 21:50:57,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,068 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 28 treesize of output 50 [2019-01-07 21:50:57,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:50:57,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,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, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:50:57,086 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:50:57,124 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:50:57,144 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:50:57,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:50:57,173 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:50:57,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:50:57,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:50:57,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,230 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 53 treesize of output 63 [2019-01-07 21:50:57,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:50:57,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:50:57,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-07 21:50:57,385 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:50:57,408 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:50:57,429 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:50:57,452 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:50:57,474 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:50:57,515 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-01-07 21:50:57,515 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-07 21:50:57,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:57,551 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 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-07 21:50:57,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:50:57,687 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-01-07 21:50:57,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-07 21:50:59,431 WARN L181 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2019-01-07 21:50:59,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:59,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:50:59,438 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:50:59,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-07 21:50:59,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:50:59,467 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-01-07 21:50:59,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:42 [2019-01-07 21:50:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:50:59,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:50:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:50:59,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:50:59,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:50:59,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:50:59,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:50:59,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:50:59,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:50:59,526 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 8 states. [2019-01-07 21:51:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:51:10,295 INFO L93 Difference]: Finished difference Result 9947 states and 70395 transitions. [2019-01-07 21:51:10,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:51:10,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-07 21:51:10,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:51:10,329 INFO L225 Difference]: With dead ends: 9947 [2019-01-07 21:51:10,329 INFO L226 Difference]: Without dead ends: 9946 [2019-01-07 21:51:10,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:51:10,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9946 states. [2019-01-07 21:51:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9946 to 9927. [2019-01-07 21:51:21,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-01-07 21:51:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-01-07 21:51:21,833 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-01-07 21:51:21,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:51:21,833 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-01-07 21:51:21,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:51:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-01-07 21:51:21,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:51:21,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:51:21,841 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-07 21:51:21,841 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:51:21,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:51:21,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1937303618, now seen corresponding path program 3 times [2019-01-07 21:51:21,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:51:21,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:51:21,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:51:21,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:51:21,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:51:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:51:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:51:21,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:51:21,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:51:21,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:51:21,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:51:21,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:51:21,904 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:51:21,913 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:51:21,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:51:21,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:51:21,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:51:21,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:51:21,940 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 21 treesize of output 24 [2019-01-07 21:51:21,943 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 24 treesize of output 30 [2019-01-07 21:51:21,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:21,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:21,946 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 26 treesize of output 40 [2019-01-07 21:51:21,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:21,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:21,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:21,953 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 28 treesize of output 54 [2019-01-07 21:51:21,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:21,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:21,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:21,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:21,962 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 30 treesize of output 72 [2019-01-07 21:51:21,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-07 21:51:21,972 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:21,997 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:51:22,019 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:51:22,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:51:22,049 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:51:22,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:51:22,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,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 48 treesize of output 54 [2019-01-07 21:51:22,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,118 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 41 treesize of output 53 [2019-01-07 21:51:22,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-07 21:51:22,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:51:22,202 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:22,217 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:51:22,232 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:51:22,247 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:51:22,278 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-01-07 21:51:22,278 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-07 21:51:22,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-07 21:51:22,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:51:22,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-07 21:51:22,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:109 [2019-01-07 21:51:22,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,594 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:51:22,595 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 72 [2019-01-07 21:51:22,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:22,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:22,706 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 8 case distinctions, treesize of input 65 treesize of output 107 [2019-01-07 21:51:22,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-01-07 21:51:23,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 6 xjuncts. [2019-01-07 21:51:23,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:280 [2019-01-07 21:51:23,150 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 92 [2019-01-07 21:51:23,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,165 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:51:23,166 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 93 [2019-01-07 21:51:23,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:23,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-07 21:51:23,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:23,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,442 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:51:23,443 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 113 [2019-01-07 21:51:23,443 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:23,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,565 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2019-01-07 21:51:23,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:23,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-07 21:51:23,645 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:227, output treesize:161 [2019-01-07 21:51:23,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,731 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 78 [2019-01-07 21:51:23,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:23,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-07 21:51:23,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:23,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:23,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 108 [2019-01-07 21:51:23,977 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:24,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 100 [2019-01-07 21:51:24,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:24,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-07 21:51:24,196 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:209, output treesize:153 [2019-01-07 21:51:24,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,299 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:51:24,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 123 [2019-01-07 21:51:24,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:24,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 118 [2019-01-07 21:51:24,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:24,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,569 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:51:24,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,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, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 125 [2019-01-07 21:51:24,572 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:24,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:24,688 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-07 21:51:24,689 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:24,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-01-07 21:51:24,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:201, output treesize:141 [2019-01-07 21:51:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:51:24,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:51:25,007 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:51:25,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:51:25,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-07 21:51:25,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:51:25,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-07 21:51:25,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-07 21:51:25,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:51:25,027 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 13 states. [2019-01-07 21:51:25,221 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-01-07 21:51:25,503 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-01-07 21:51:25,785 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-01-07 21:51:26,959 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-01-07 21:51:28,532 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-01-07 21:51:42,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:51:42,031 INFO L93 Difference]: Finished difference Result 12394 states and 87417 transitions. [2019-01-07 21:51:42,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-07 21:51:42,031 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-07 21:51:42,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:51:42,072 INFO L225 Difference]: With dead ends: 12394 [2019-01-07 21:51:42,072 INFO L226 Difference]: Without dead ends: 12392 [2019-01-07 21:51:42,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-01-07 21:51:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2019-01-07 21:51:51,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 7195. [2019-01-07 21:51:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7195 states. [2019-01-07 21:51:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7195 states to 7195 states and 51194 transitions. [2019-01-07 21:51:51,676 INFO L78 Accepts]: Start accepts. Automaton has 7195 states and 51194 transitions. Word has length 7 [2019-01-07 21:51:51,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:51:51,677 INFO L480 AbstractCegarLoop]: Abstraction has 7195 states and 51194 transitions. [2019-01-07 21:51:51,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-07 21:51:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 7195 states and 51194 transitions. [2019-01-07 21:51:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:51:51,683 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:51:51,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:51:51,683 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:51:51,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:51:51,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1937075524, now seen corresponding path program 1 times [2019-01-07 21:51:51,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:51:51,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:51:51,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:51:51,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:51:51,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:51:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:51:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:51:51,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:51:51,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:51:51,752 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:51:51,752 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [28], [30], [31] [2019-01-07 21:51:51,753 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:51:51,753 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:51:51,754 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:51:51,755 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-01-07 21:51:51,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:51:51,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:51:51,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:51:51,755 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:51:51,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:51:51,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:51:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:51:51,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:51:51,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:51:51,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:51:51,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:51,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:51,784 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 26 treesize of output 36 [2019-01-07 21:51:51,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:51,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:51,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:51,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-07 21:51:51,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:51,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:51,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:51,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:51,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:51:51,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:51,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:51,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:51,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:51,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:51,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:51:51,811 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:51,847 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:51:52,003 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:51:52,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:51:52,030 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:51:52,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:51:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:51:52,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,086 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 53 treesize of output 63 [2019-01-07 21:51:52,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:51:52,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:51:52,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-07 21:51:52,240 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:52,262 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:51:52,283 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:51:52,305 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:51:52,330 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:51:52,370 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-01-07 21:51:52,370 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-07 21:51:52,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,414 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 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-07 21:51:52,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:51:52,550 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-01-07 21:51:52,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-01-07 21:51:52,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,652 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 90 [2019-01-07 21:51:52,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:52,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,740 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 81 treesize of output 127 [2019-01-07 21:51:52,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:52,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-07 21:51:52,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:150, output treesize:94 [2019-01-07 21:51:52,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,869 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:51:52,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,871 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-07 21:51:52,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:52,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,955 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:51:52,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:51:52,957 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 138 [2019-01-07 21:51:52,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 21:51:53,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-07 21:51:53,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:118, output treesize:100 [2019-01-07 21:51:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:51:53,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:51:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:51:53,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:51:53,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:51:53,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:51:53,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:51:53,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:51:53,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:51:53,157 INFO L87 Difference]: Start difference. First operand 7195 states and 51194 transitions. Second operand 10 states. [2019-01-07 21:51:53,549 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-01-07 21:51:55,277 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-01-07 21:52:03,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:52:03,886 INFO L93 Difference]: Finished difference Result 7367 states and 52064 transitions. [2019-01-07 21:52:03,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:52:03,887 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:52:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:52:03,910 INFO L225 Difference]: With dead ends: 7367 [2019-01-07 21:52:03,911 INFO L226 Difference]: Without dead ends: 7366 [2019-01-07 21:52:03,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:52:03,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7366 states. [2019-01-07 21:52:13,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7366 to 7259. [2019-01-07 21:52:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7259 states. [2019-01-07 21:52:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 51642 transitions. [2019-01-07 21:52:13,969 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 51642 transitions. Word has length 7 [2019-01-07 21:52:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:52:13,969 INFO L480 AbstractCegarLoop]: Abstraction has 7259 states and 51642 transitions. [2019-01-07 21:52:13,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:52:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 51642 transitions. [2019-01-07 21:52:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:52:13,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:52:13,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:52:13,975 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:52:13,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:52:13,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1924490204, now seen corresponding path program 2 times [2019-01-07 21:52:13,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:52:13,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:52:13,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:52:13,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:52:13,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:52:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:52:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:52:14,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:52:14,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:52:14,115 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:52:14,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:52:14,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:52:14,115 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:52:14,124 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:52:14,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:52:14,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:52:14,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:52:14,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:52:14,152 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 21 treesize of output 24 [2019-01-07 21:52:14,154 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 24 treesize of output 30 [2019-01-07 21:52:14,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,159 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 26 treesize of output 40 [2019-01-07 21:52:14,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,166 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 28 treesize of output 54 [2019-01-07 21:52:14,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,174 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 30 treesize of output 72 [2019-01-07 21:52:14,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,183 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:52:14,183 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:52:14,223 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:14,245 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:14,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:14,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:14,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:14,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,319 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-01-07 21:52:14,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,357 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-01-07 21:52:14,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,401 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-01-07 21:52:14,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,456 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-01-07 21:52:14,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,525 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-01-07 21:52:14,526 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:52:14,550 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:14,574 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:14,597 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:14,621 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:14,665 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-01-07 21:52:14,665 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-07 21:52:14,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,702 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-01-07 21:52:14,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:52:14,745 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-01-07 21:52:14,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-07 21:52:14,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,783 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-01-07 21:52:14,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:52:14,832 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-01-07 21:52:14,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-07 21:52:14,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,872 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:52:14,873 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-01-07 21:52:14,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:52:14,918 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-01-07 21:52:14,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-07 21:52:14,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:14,960 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:52:14,961 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-01-07 21:52:14,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:52:15,008 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-01-07 21:52:15,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-01-07 21:52:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:52:15,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:52:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:52:15,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:52:15,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-07 21:52:15,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:52:15,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:52:15,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:52:15,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:52:15,098 INFO L87 Difference]: Start difference. First operand 7259 states and 51642 transitions. Second operand 11 states. [2019-01-07 21:52:32,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:52:32,334 INFO L93 Difference]: Finished difference Result 9936 states and 70364 transitions. [2019-01-07 21:52:32,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-07 21:52:32,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-07 21:52:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:52:32,368 INFO L225 Difference]: With dead ends: 9936 [2019-01-07 21:52:32,369 INFO L226 Difference]: Without dead ends: 9935 [2019-01-07 21:52:32,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:52:32,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9935 states. [2019-01-07 21:52:47,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9935 to 8951. [2019-01-07 21:52:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8951 states. [2019-01-07 21:52:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8951 states to 8951 states and 63743 transitions. [2019-01-07 21:52:47,479 INFO L78 Accepts]: Start accepts. Automaton has 8951 states and 63743 transitions. Word has length 7 [2019-01-07 21:52:47,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:52:47,480 INFO L480 AbstractCegarLoop]: Abstraction has 8951 states and 63743 transitions. [2019-01-07 21:52:47,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:52:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 8951 states and 63743 transitions. [2019-01-07 21:52:47,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:52:47,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:52:47,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:52:47,487 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:52:47,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:52:47,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1928257388, now seen corresponding path program 1 times [2019-01-07 21:52:47,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:52:47,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:52:47,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:52:47,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:52:47,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:52:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:52:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:52:47,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:52:47,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:52:47,578 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:52:47,578 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [30], [31] [2019-01-07 21:52:47,579 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:52:47,579 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:52:47,580 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:52:47,580 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-01-07 21:52:47,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:52:47,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:52:47,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:52:47,581 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:52:47,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:52:47,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:52:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:52:47,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:52:47,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-07 21:52:47,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,617 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 53 treesize of output 63 [2019-01-07 21:52:47,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-07 21:52:47,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-07 21:52:47,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:47,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52: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, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-07 21:52:47,772 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:52:47,796 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:47,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:47,843 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:47,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:47,899 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 21 treesize of output 24 [2019-01-07 21:52:47,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-07 21:52:47,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-07 21:52:47,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-07 21:52:47,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, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:52:47,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-07 21:52:47,915 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:52:47,947 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:47,965 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:47,979 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:47,990 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:48,001 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:52:48,041 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-01-07 21:52:48,041 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-07 21:52:48,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:48,082 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 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-07 21:52:48,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:52:48,220 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-01-07 21:52:48,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-07 21:52:48,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:48,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:48,266 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:52: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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-07 21:52:48,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:52:48,295 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-01-07 21:52:48,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-01-07 21:52:48,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:48,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:48,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:48,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:48,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:48,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:48,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:48,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:48,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:52:48,325 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-07 21:52:48,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:52:48,355 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-01-07 21:52:48,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-01-07 21:52:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:52:48,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:52:48,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:52:48,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:52:48,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:52:48,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:52:48,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:52:48,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:52:48,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:52:48,421 INFO L87 Difference]: Start difference. First operand 8951 states and 63743 transitions. Second operand 10 states. [2019-01-07 21:53:04,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:53:04,137 INFO L93 Difference]: Finished difference Result 9235 states and 65371 transitions. [2019-01-07 21:53:04,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:53:04,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:53:04,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:53:04,167 INFO L225 Difference]: With dead ends: 9235 [2019-01-07 21:53:04,167 INFO L226 Difference]: Without dead ends: 9232 [2019-01-07 21:53:04,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:53:04,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9232 states. [2019-01-07 21:53:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9232 to 9044. [2019-01-07 21:53:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-01-07 21:53:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 64394 transitions. [2019-01-07 21:53:20,047 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 64394 transitions. Word has length 7 [2019-01-07 21:53:20,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:53:20,047 INFO L480 AbstractCegarLoop]: Abstraction has 9044 states and 64394 transitions. [2019-01-07 21:53:20,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:53:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 64394 transitions. [2019-01-07 21:53:20,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:53:20,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:53:20,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:53:20,054 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:53:20,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:53:20,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1928378538, now seen corresponding path program 1 times [2019-01-07 21:53:20,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:53:20,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:53:20,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:53:20,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:53:20,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:53:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:53:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:53:20,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:53:20,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:53:20,133 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:53:20,133 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [30], [32], [33] [2019-01-07 21:53:20,136 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:53:20,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:53:20,137 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:53:20,137 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-01-07 21:53:20,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:53:20,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:53:20,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:53:20,138 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:53:20,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:53:20,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:53:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:53:20,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:53:20,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-07 21:53:20,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:20,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:20,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-07 21:53:20,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:20,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:20,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:20,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:20,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-07 21:53:20,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:20,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:20,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:20,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:20,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:20,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:20,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-07 21:53:20,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 21:53:20,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:20,304 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:20,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:20,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:53:20,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, 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 26 [2019-01-07 21:53:20,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-07 21:53:20,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-07 21:53:20,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, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-07 21:53:20,362 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-07 21:53:20,363 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-07 21:53:20,386 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:20,404 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:20,416 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:20,427 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:20,438 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:20,466 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-01-07 21:53:20,466 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-07 21:53:20,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:20,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:53:20,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:53:20,601 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-01-07 21:53:20,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-07 21:53:20,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:20,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:20,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:20,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:20,643 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:53:20,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-07 21:53:20,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:53:20,663 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-01-07 21:53:20,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:29 [2019-01-07 21:53:20,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:53:20,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:53:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:53:20,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:53:20,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:53:20,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:53:20,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:53:20,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:53:20,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:53:20,724 INFO L87 Difference]: Start difference. First operand 9044 states and 64394 transitions. Second operand 8 states. [2019-01-07 21:53:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:53:35,723 INFO L93 Difference]: Finished difference Result 9065 states and 64420 transitions. [2019-01-07 21:53:35,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:53:35,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-07 21:53:35,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:53:35,753 INFO L225 Difference]: With dead ends: 9065 [2019-01-07 21:53:35,753 INFO L226 Difference]: Without dead ends: 9064 [2019-01-07 21:53:35,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:53:35,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2019-01-07 21:53:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 9045. [2019-01-07 21:53:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9045 states. [2019-01-07 21:53:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9045 states to 9045 states and 64401 transitions. [2019-01-07 21:53:51,560 INFO L78 Accepts]: Start accepts. Automaton has 9045 states and 64401 transitions. Word has length 7 [2019-01-07 21:53:51,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:53:51,560 INFO L480 AbstractCegarLoop]: Abstraction has 9045 states and 64401 transitions. [2019-01-07 21:53:51,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:53:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 9045 states and 64401 transitions. [2019-01-07 21:53:51,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:53:51,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:53:51,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:53:51,568 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:53:51,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:53:51,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1904967206, now seen corresponding path program 1 times [2019-01-07 21:53:51,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:53:51,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:53:51,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:53:51,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:53:51,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:53:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:53:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:53:51,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:53:51,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:53:51,663 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:53:51,663 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [24], [27] [2019-01-07 21:53:51,663 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:53:51,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:53:51,666 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:53:51,666 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-07 21:53:51,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:53:51,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:53:51,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:53:51,667 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:53:51,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:53:51,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:53:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:53:51,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:53:51,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,705 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-01-07 21:53:51,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,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 58 treesize of output 67 [2019-01-07 21:53:51,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,794 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-01-07 21:53:51,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,854 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-01-07 21:53:51,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:51,922 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-01-07 21:53:51,923 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:53:51,953 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:51,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:52,012 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:52,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:52,076 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 21 treesize of output 24 [2019-01-07 21:53:52,082 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 24 treesize of output 30 [2019-01-07 21:53:52,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:53:52,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:53:52,089 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 30 treesize of output 72 [2019-01-07 21:53:52,092 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:53:52,093 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-07 21:53:52,128 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:52,147 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:52,162 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:52,174 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:52,186 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:52,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:53:52,228 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 2 variables, input treesize:92, output treesize:91 [2019-01-07 21:53:52,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,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-01-07 21:53:52,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:53:52,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:53:52,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:101, output treesize:71 [2019-01-07 21:53:52,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,420 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-01-07 21:53:52,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:53:52,462 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-01-07 21:53:52,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:55 [2019-01-07 21:53:52,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,510 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:53:52,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,512 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-01-07 21:53:52,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:53:52,559 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-01-07 21:53:52,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:47 [2019-01-07 21:53:52,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,599 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:53:52,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:52,601 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-01-07 21:53:52,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:53:52,650 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-01-07 21:53:52,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:49 [2019-01-07 21:53:54,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:54,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:54,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:54,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:54,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:54,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:54,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:54,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:54,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:54,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:54,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:54,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:54,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:54,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:54,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:53:54,710 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:53:54,711 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 47 treesize of output 127 [2019-01-07 21:53:54,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:53:54,756 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-01-07 21:53:54,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:53 [2019-01-07 21:53:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:53:54,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:53:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:53:54,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:53:54,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-07 21:53:54,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:53:54,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 21:53:54,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 21:53:54,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=252, Unknown=1, NotChecked=0, Total=380 [2019-01-07 21:53:54,896 INFO L87 Difference]: Start difference. First operand 9045 states and 64401 transitions. Second operand 14 states. [2019-01-07 21:54:06,894 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-07 21:54:06,896 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-01-07 21:54:06,900 INFO L168 Benchmark]: Toolchain (without parser) took 754050.52 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-01-07 21:54:06,900 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:54:06,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:54:06,901 INFO L168 Benchmark]: Boogie Preprocessor took 26.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:54:06,901 INFO L168 Benchmark]: RCFGBuilder took 580.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-07 21:54:06,901 INFO L168 Benchmark]: TraceAbstraction took 753379.28 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-01-07 21:54:06,903 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 580.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 753379.28 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. 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...