java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:43:34,376 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:43:34,378 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:43:34,390 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:43:34,390 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:43:34,391 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:43:34,393 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:43:34,394 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:43:34,396 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:43:34,397 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:43:34,398 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:43:34,398 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:43:34,399 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:43:34,400 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:43:34,401 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:43:34,402 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:43:34,403 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:43:34,405 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:43:34,407 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:43:34,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:43:34,410 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:43:34,411 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:43:34,413 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:43:34,413 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:43:34,414 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:43:34,415 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:43:34,416 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:43:34,416 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:43:34,417 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:43:34,419 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:43:34,419 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:43:34,419 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:43:34,420 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:43:34,420 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:43:34,421 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:43:34,422 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:43:34,422 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-11 11:43:34,435 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:43:34,435 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:43:34,436 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:43:34,436 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:43:34,436 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:43:34,436 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:43:34,436 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:43:34,437 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:43:34,437 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:43:34,437 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-11 11:43:34,437 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-11 11:43:34,437 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:43:34,438 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:43:34,438 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:43:34,438 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:43:34,439 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:43:34,439 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:43:34,439 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:43:34,439 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:43:34,439 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:43:34,440 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:43:34,440 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:43:34,440 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:43:34,440 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:43:34,440 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:43:34,441 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:43:34,441 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:43:34,441 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:43:34,441 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:43:34,441 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:43:34,442 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:43:34,442 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:43:34,442 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:43:34,442 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:43:34,442 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:43:34,443 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:43:34,443 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:43:34,443 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:43:34,443 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:43:34,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:43:34,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:43:34,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:43:34,495 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:43:34,498 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:43:34,499 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl [2019-01-11 11:43:34,499 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-01-11 11:43:34,559 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:43:34,560 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:43:34,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:43:34,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:43:34,561 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:43:34,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:43:34" (1/1) ... [2019-01-11 11:43:34,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:43:34" (1/1) ... [2019-01-11 11:43:34,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:43:34,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:43:34,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:43:34,630 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:43:34,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:43:34" (1/1) ... [2019-01-11 11:43:34,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:43:34" (1/1) ... [2019-01-11 11:43:34,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:43:34" (1/1) ... [2019-01-11 11:43:34,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:43:34" (1/1) ... [2019-01-11 11:43:34,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:43:34" (1/1) ... [2019-01-11 11:43:34,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:43:34" (1/1) ... [2019-01-11 11:43:34,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:43:34" (1/1) ... [2019-01-11 11:43:34,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:43:34,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:43:34,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:43:34,661 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:43:34,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:43:34" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 11:43:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:43:34,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:43:34,986 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:43:34,987 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-11 11:43:34,989 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:43:34 BoogieIcfgContainer [2019-01-11 11:43:34,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:43:34,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:43:34,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:43:34,995 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:43:34,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:43:34" (1/2) ... [2019-01-11 11:43:34,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe1ce00 and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:43:34, skipping insertion in model container [2019-01-11 11:43:34,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:43:34" (2/2) ... [2019-01-11 11:43:35,003 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-01-11 11:43:35,021 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:43:35,040 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-11 11:43:35,080 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-11 11:43:35,144 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:43:35,144 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:43:35,144 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:43:35,144 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:43:35,144 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:43:35,145 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:43:35,145 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:43:35,145 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:43:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-11 11:43:35,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-11 11:43:35,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:35,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-11 11:43:35,172 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:43:35,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:35,179 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-11 11:43:35,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:35,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:35,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:35,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:35,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:35,385 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-11 11:43:35,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:43:35,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 11:43:35,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:43:35,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:43:35,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:43:35,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:43:35,405 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-11 11:43:35,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:35,653 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-11 11:43:35,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:43:35,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-11 11:43:35,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:35,674 INFO L225 Difference]: With dead ends: 25 [2019-01-11 11:43:35,674 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 11:43:35,683 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-11 11:43:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 11:43:35,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-11 11:43:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 11:43:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-11 11:43:35,726 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-11 11:43:35,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:35,727 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-11 11:43:35,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:43:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-11 11:43:35,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:43:35,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:35,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:43:35,734 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:43:35,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:35,734 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-11 11:43:35,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:35,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:35,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:35,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:35,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:36,051 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2019-01-11 11:43:36,070 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-11 11:43:36,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:36,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:36,072 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:43:36,073 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-11 11:43:36,152 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:43:36,152 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:43:37,123 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:43:37,126 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:43:37,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:37,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:43:37,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:37,135 INFO 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-11 11:43:37,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:37,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:43:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:37,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:37,433 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-11 11:43:37,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:37,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:43:37,836 WARN L181 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-11 11:43:37,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:37,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:37,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:43:38,064 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-11 11:43:38,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:38,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:38,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:38,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:38,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:43:38,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:38,137 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:38,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:38,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:43:38,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, 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 27 [2019-01-11 11:43:38,355 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 23 treesize of output 37 [2019-01-11 11:43:38,376 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 25 treesize of output 51 [2019-01-11 11:43:38,490 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-01-11 11:43:38,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:43:38,493 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:38,730 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:38,762 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:38,799 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:38,833 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:38,911 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-11 11:43:38,912 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 11:43:39,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:39,077 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-11 11:43:39,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:39,124 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-11 11:43:39,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-11 11:43:39,143 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-11 11:43:39,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:39,225 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-11 11:43:39,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:43:39,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:43:39,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:43:39,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:43:39,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:43:39,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:43:39,248 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-01-11 11:43:39,410 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-11 11:43:39,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:39,830 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-01-11 11:43:39,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:43:39,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:43:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:39,833 INFO L225 Difference]: With dead ends: 39 [2019-01-11 11:43:39,833 INFO L226 Difference]: Without dead ends: 37 [2019-01-11 11:43:39,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:43:39,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-11 11:43:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-01-11 11:43:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-11 11:43:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-01-11 11:43:39,840 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-01-11 11:43:39,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:39,841 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-01-11 11:43:39,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:43:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-01-11 11:43:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:43:39,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:39,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:43:39,842 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:43:39,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:39,843 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-11 11:43:39,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:39,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:39,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:39,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:39,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:39,962 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-11 11:43:39,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:39,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:39,963 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:43:39,963 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-11 11:43:39,965 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:43:39,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:43:42,959 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:43:42,959 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:43:42,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:42,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:43:42,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:42,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 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-11 11:43:42,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:42,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:43:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:42,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:43,160 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-11 11:43:43,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:43,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:43:43,341 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-11 11:43:43,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:43,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:43,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:43:43,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:43,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:43,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:43,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:43,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:43:43,385 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:43,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:43,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:43,466 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 18 treesize of output 21 [2019-01-11 11:43:43,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:43:43,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:43:43,493 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 25 treesize of output 51 [2019-01-11 11:43:43,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:43:43,510 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:43,551 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:43,582 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:43,596 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:43,608 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:43,676 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-11 11:43:43,677 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 11:43:43,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:43,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:43:43,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 11:43:43,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-11 11:43:43,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:183 [2019-01-11 11:43:44,136 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-11 11:43:44,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:44,144 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-11 11:43:44,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:43:44,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 11:43:44,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:43:44,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:43:44,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:43:44,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:43:44,165 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-01-11 11:43:44,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:44,210 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-01-11 11:43:44,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:43:44,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-11 11:43:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:44,213 INFO L225 Difference]: With dead ends: 18 [2019-01-11 11:43:44,213 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 11:43:44,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:43:44,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 11:43:44,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-11 11:43:44,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 11:43:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-01-11 11:43:44,218 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-01-11 11:43:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:44,218 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-01-11 11:43:44,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:43:44,219 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-01-11 11:43:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:43:44,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:44,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:43:44,219 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:43:44,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:44,220 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-01-11 11:43:44,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:44,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:44,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:44,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:44,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:44,252 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-11 11:43:44,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:43:44,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 11:43:44,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:43:44,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:43:44,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:43:44,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:43:44,254 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-01-11 11:43:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:44,304 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-01-11 11:43:44,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:43:44,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-11 11:43:44,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:44,306 INFO L225 Difference]: With dead ends: 21 [2019-01-11 11:43:44,306 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 11:43:44,307 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-11 11:43:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 11:43:44,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-11 11:43:44,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 11:43:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-11 11:43:44,312 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-11 11:43:44,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:44,313 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-11 11:43:44,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:43:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-11 11:43:44,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:43:44,314 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:44,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:43:44,314 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:43:44,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:44,314 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-01-11 11:43:44,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:44,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:44,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:44,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:44,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:44,387 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-11 11:43:44,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:44,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:44,388 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:43:44,388 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-01-11 11:43:44,391 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:43:44,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:43:44,648 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:43:44,648 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:43:44,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:44,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:43:44,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:44,649 INFO 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-11 11:43:44,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:44,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:43:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:44,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:44,829 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-11 11:43:44,844 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 18 treesize of output 21 [2019-01-11 11:43: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 21 treesize of output 27 [2019-01-11 11:43:44,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:44,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:44,926 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 23 treesize of output 37 [2019-01-11 11:43:44,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:44,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:45,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:45,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:43:45,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:43:45,098 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:45,124 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:45,143 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:45,153 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:45,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:45,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:45,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:43:45,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:45,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:45,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:43:45,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:45,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:45,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:45,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:45,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:43:45,301 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:45,315 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:45,324 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:45,347 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-11 11:43:45,348 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 11:43:45,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:45,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:43:45,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:45,422 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-11 11:43:45,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-11 11:43:45,457 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-11 11:43:45,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:45,471 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-11 11:43:45,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:43:45,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:43:45,490 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:43:45,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:43:45,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:43:45,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:43:45,492 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-01-11 11:43:45,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:45,669 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-01-11 11:43:45,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:43:45,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:43:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:45,672 INFO L225 Difference]: With dead ends: 39 [2019-01-11 11:43:45,672 INFO L226 Difference]: Without dead ends: 38 [2019-01-11 11:43:45,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:43:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-11 11:43:45,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-01-11 11:43:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-11 11:43:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-11 11:43:45,678 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-01-11 11:43:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:45,678 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-11 11:43:45,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:43:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-11 11:43:45,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:43:45,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:45,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:43:45,680 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:43:45,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:45,680 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-01-11 11:43:45,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:45,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:45,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:45,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:45,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:45,760 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-11 11:43:45,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:45,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:45,761 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:43:45,761 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-01-11 11:43:45,763 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:43:45,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:43:46,246 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:43:46,247 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:43:46,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:46,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:43:46,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:46,248 INFO 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-11 11:43:46,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:46,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:43:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:46,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:46,301 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 18 treesize of output 21 [2019-01-11 11:43:46,309 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 21 treesize of output 27 [2019-01-11 11:43:46,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,335 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 23 treesize of output 37 [2019-01-11 11:43:46,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:43:46,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:43:46,379 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:46,400 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:46,419 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:46,432 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:46,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:46,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:43:46,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:43:46,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:43:46,582 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:46,590 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:46,600 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:46,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-11 11:43:46,623 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 11:43:46,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-01-11 11:43:46,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:43:46,747 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-11 11:43:46,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:74 [2019-01-11 11:43:46,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:46,841 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 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-11 11:43:46,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 11:43:47,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:47,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:47,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:47,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:47,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:47,075 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:43:47,077 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 45 treesize of output 51 [2019-01-11 11:43:47,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:47,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-11 11:43:47,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-01-11 11:43:47,370 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-11 11:43:47,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:47,444 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-11 11:43:47,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:43:47,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:43:47,465 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:43:47,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:43:47,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:43:47,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:43:47,466 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-01-11 11:43:48,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:48,026 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-01-11 11:43:48,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:43:48,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:43:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:48,028 INFO L225 Difference]: With dead ends: 59 [2019-01-11 11:43:48,028 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:43:48,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:43:48,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:43:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-01-11 11:43:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-11 11:43:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-01-11 11:43:48,037 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-01-11 11:43:48,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:48,038 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-01-11 11:43:48,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:43:48,038 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-01-11 11:43:48,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:43:48,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:48,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:43:48,039 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:43:48,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:48,039 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-01-11 11:43:48,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:48,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:48,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:48,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:48,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:48,073 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-11 11:43:48,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:48,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:48,074 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:43:48,074 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-01-11 11:43:48,075 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:43:48,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:43:48,271 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:43:48,272 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:43:48,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:48,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:43:48,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:48,273 INFO 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-11 11:43:48,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:48,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:43:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:48,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:48,328 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 18 treesize of output 21 [2019-01-11 11:43:48,374 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 21 treesize of output 23 [2019-01-11 11:43:48,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:48,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:48,405 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 23 treesize of output 33 [2019-01-11 11:43:48,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:48,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:48,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:48,415 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 25 treesize of output 47 [2019-01-11 11:43:48,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, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:43:48,433 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:48,457 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:48,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:48,480 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:48,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:48,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 11:43:48,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:48,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:48,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 11:43:48,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:48,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:48,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:48,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:48,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:43:48,556 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:48,568 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:48,578 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:48,598 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-11 11:43:48,599 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-11 11:43:48,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:48,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-01-11 11:43:48,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:48,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:43:48,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-01-11 11:43:48,664 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-11 11:43:48,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:48,679 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-11 11:43:48,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:43:48,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-11 11:43:48,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:43:48,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:43:48,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:43:48,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:43:48,699 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-01-11 11:43:48,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:48,823 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-01-11 11:43:48,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:43:48,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 11:43:48,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:48,825 INFO L225 Difference]: With dead ends: 25 [2019-01-11 11:43:48,825 INFO L226 Difference]: Without dead ends: 24 [2019-01-11 11:43:48,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:43:48,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-11 11:43:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-11 11:43:48,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 11:43:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-01-11 11:43:48,840 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-01-11 11:43:48,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:48,840 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-01-11 11:43:48,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:43:48,840 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-01-11 11:43:48,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:43:48,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:48,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:43:48,841 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:43:48,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:48,841 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-01-11 11:43:48,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:48,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:48,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:48,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:48,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:48,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:48,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:48,997 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:43:48,997 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-01-11 11:43:49,000 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:43:49,000 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:43:49,340 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:43:49,340 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:43:49,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:49,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:43:49,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:49,341 INFO 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-11 11:43:49,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:49,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:43:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:49,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:49,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:43:49,438 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 21 treesize of output 27 [2019-01-11 11:43:49,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:49,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:49,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:43:49,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:49,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:49,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:49,463 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 25 treesize of output 51 [2019-01-11 11:43:49,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:43:49,479 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:49,501 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:49,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:49,527 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:49,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:49,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:49,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:43:49,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:49,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:49,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 27 treesize of output 42 [2019-01-11 11:43:49,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:49,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:49,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:49,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:49,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:43:49,646 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:49,655 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:49,665 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:49,687 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-11 11:43:49,687 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 11:43:49,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:49,738 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-11 11:43:49,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:49,769 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-11 11:43:49,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 11:43:49,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:49,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:49,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:49,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:49,801 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:43:49,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:43:49,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:49,838 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-11 11:43:49,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-01-11 11:43:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:49,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:49,880 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-11 11:43:49,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:43:49,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:43:49,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:43:49,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:43:49,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:43:49,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:43:49,901 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-01-11 11:43:50,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:50,388 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-01-11 11:43:50,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:43:50,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:43:50,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:50,390 INFO L225 Difference]: With dead ends: 56 [2019-01-11 11:43:50,391 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:43:50,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:43:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:43:50,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-01-11 11:43:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-11 11:43:50,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-01-11 11:43:50,400 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-01-11 11:43:50,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:50,400 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-01-11 11:43:50,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:43:50,401 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-01-11 11:43:50,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:43:50,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:50,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:43:50,402 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:43:50,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:50,402 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-01-11 11:43:50,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:50,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:50,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:50,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:50,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:50,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:50,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:50,475 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:43:50,475 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-01-11 11:43:50,476 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:43:50,476 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:43:50,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:43:50,740 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:43:50,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:50,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:43:50,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:50,741 INFO 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-11 11:43:50,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:50,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:43:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:50,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:50,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:50,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:43:50,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:50,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:50,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:43:50,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:50,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:50,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:50,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:50,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:43:50,908 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:50,917 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:50,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:50,944 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 18 treesize of output 21 [2019-01-11 11:43:50,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, 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 27 [2019-01-11 11:43:50,949 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 23 treesize of output 37 [2019-01-11 11:43:50,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 25 treesize of output 51 [2019-01-11 11:43:50,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:43:50,960 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:50,980 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:50,997 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:51,008 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:51,019 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:51,041 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-11 11:43:51,042 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 11:43:51,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:51,105 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-11 11:43:51,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:51,123 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-11 11:43:51,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 11:43:51,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:51,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:51,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:51,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:51,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:51,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:51,149 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-11 11:43:51,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:51,171 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-11 11:43:51,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 11:43:51,187 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-11 11:43:51,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:51,209 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-11 11:43:51,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:43:51,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:43:51,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:43:51,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:43:51,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:43:51,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:43:51,229 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-01-11 11:43:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:51,583 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-01-11 11:43:51,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:43:51,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:43:51,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:51,584 INFO L225 Difference]: With dead ends: 52 [2019-01-11 11:43:51,584 INFO L226 Difference]: Without dead ends: 48 [2019-01-11 11:43:51,585 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-11 11:43:51,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-11 11:43:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-01-11 11:43:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 11:43:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-11 11:43:51,594 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-11 11:43:51,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:51,595 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-11 11:43:51,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:43:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-11 11:43:51,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:43:51,595 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:51,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:43:51,596 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:43:51,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:51,596 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-01-11 11:43:51,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:51,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:51,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:51,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:51,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:51,635 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-11 11:43:51,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:51,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:51,636 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:43:51,636 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-01-11 11:43:51,638 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:43:51,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:43:53,569 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:43:53,569 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:43:53,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:53,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:43:53,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:53,570 INFO 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-11 11:43:53,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:53,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:43:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:53,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:53,631 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 18 treesize of output 21 [2019-01-11 11:43:53,636 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 21 treesize of output 23 [2019-01-11 11:43:53,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,648 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 23 treesize of output 33 [2019-01-11 11:43:53,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,659 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 25 treesize of output 47 [2019-01-11 11:43:53,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,673 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 27 treesize of output 62 [2019-01-11 11:43:53,673 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:53,708 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:53,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:53,733 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:53,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:53,771 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-11 11:43:53,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,790 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-11 11:43:53,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:43:53,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:53,881 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-11 11:43:53,881 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:53,897 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:53,913 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:53,932 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:54,002 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-11 11:43:54,003 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 11:43:54,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:54,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, 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-11 11:43:54,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:54,061 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-11 11:43:54,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-11 11:43:54,077 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-11 11:43:54,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:54,092 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-11 11:43:54,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:43:54,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:43:54,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:43:54,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:43:54,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:43:54,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:43:54,121 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-01-11 11:43:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:54,325 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-01-11 11:43:54,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:43:54,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 11:43:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:54,327 INFO L225 Difference]: With dead ends: 42 [2019-01-11 11:43:54,327 INFO L226 Difference]: Without dead ends: 41 [2019-01-11 11:43:54,328 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-11 11:43:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-11 11:43:54,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-01-11 11:43:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 11:43:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-11 11:43:54,337 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-11 11:43:54,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:54,338 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-11 11:43:54,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:43:54,338 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-11 11:43:54,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:43:54,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:54,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:43:54,339 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:43:54,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:54,339 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-01-11 11:43:54,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:54,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:54,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:54,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:54,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:54,469 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-11 11:43:54,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:54,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:54,470 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:43:54,470 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-01-11 11:43:54,472 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:43:54,472 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:43:55,059 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:43:55,059 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:43:55,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:55,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:43:55,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:55,060 INFO 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-11 11:43:55,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:55,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:43:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:55,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:55,103 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 18 treesize of output 21 [2019-01-11 11:43:55,107 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 21 treesize of output 27 [2019-01-11 11:43:55,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,118 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 23 treesize of output 37 [2019-01-11 11:43:55,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,145 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 25 treesize of output 51 [2019-01-11 11:43:55,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,158 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:43:55,159 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:55,193 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:55,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:55,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:55,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:55,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,262 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-11 11:43:55,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,297 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-11 11:43:55,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,336 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-11 11:43:55,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,386 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-11 11:43:55,387 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:55,404 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:55,418 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:55,434 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:55,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-11 11:43:55,465 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-11 11:43:55,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,493 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-11 11:43:55,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:55,525 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-11 11:43:55,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:43:55,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:55,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 36 treesize of output 86 [2019-01-11 11:43:55,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:55,589 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-11 11:43:55,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-11 11:43:55,605 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-11 11:43:55,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:55,639 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-11 11:43:55,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:43:55,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:43:55,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:43:55,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:43:55,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:43:55,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:43:55,660 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-01-11 11:43:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:56,073 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-01-11 11:43:56,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:43:56,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:43:56,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:56,075 INFO L225 Difference]: With dead ends: 54 [2019-01-11 11:43:56,075 INFO L226 Difference]: Without dead ends: 53 [2019-01-11 11:43:56,076 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-11 11:43:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-11 11:43:56,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-01-11 11:43:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-11 11:43:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-01-11 11:43:56,085 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-01-11 11:43:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:56,085 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-01-11 11:43:56,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:43:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-01-11 11:43:56,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:43:56,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:56,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:43:56,086 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:43:56,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:56,087 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-01-11 11:43:56,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:56,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:56,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:56,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:56,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:56,214 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-11 11:43:56,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:56,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:56,214 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:43:56,215 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-01-11 11:43:56,215 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:43:56,216 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:43:56,509 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:43:56,509 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:43:56,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:56,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:43:56,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:56,510 INFO 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-11 11:43:56,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:56,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:43:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:56,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:56,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:56,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:43:56,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:56,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:56,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:43:56,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:56,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:56,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:56,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:56,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:43:56,650 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:56,661 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:56,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:56,696 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 18 treesize of output 21 [2019-01-11 11:43:56,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 27 [2019-01-11 11:43:56,718 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 23 treesize of output 37 [2019-01-11 11:43:56,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:43:56,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:43:56,755 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:56,773 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:56,787 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:56,799 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:56,809 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:56,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:43:56,833 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 11:43:56,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:56,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:43:56,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:56,907 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-11 11:43:56,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 11:43:56,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:56,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:56,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:56,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:56,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:56,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:56,932 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-11 11:43:56,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:56,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-11 11:43:56,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-11 11:43:56,973 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-11 11:43:56,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:56,995 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-11 11:43:57,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:43:57,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:43:57,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:43:57,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:43:57,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:43:57,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:43:57,016 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-01-11 11:43:57,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:57,327 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-01-11 11:43:57,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:43:57,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:43:57,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:57,328 INFO L225 Difference]: With dead ends: 63 [2019-01-11 11:43:57,329 INFO L226 Difference]: Without dead ends: 61 [2019-01-11 11:43:57,329 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-11 11:43:57,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-11 11:43:57,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-01-11 11:43:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 11:43:57,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-01-11 11:43:57,340 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-01-11 11:43:57,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:57,340 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-01-11 11:43:57,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:43:57,341 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-01-11 11:43:57,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:43:57,341 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:57,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:43:57,342 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:43:57,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:57,342 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-01-11 11:43:57,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:57,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:57,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:57,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:57,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:57,405 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-11 11:43:57,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:43:57,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 11:43:57,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:43:57,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:43:57,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:43:57,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:43:57,407 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-01-11 11:43:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:57,488 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-01-11 11:43:57,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:43:57,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 11:43:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:57,490 INFO L225 Difference]: With dead ends: 41 [2019-01-11 11:43:57,490 INFO L226 Difference]: Without dead ends: 40 [2019-01-11 11:43:57,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:43:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-11 11:43:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-01-11 11:43:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 11:43:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-01-11 11:43:57,500 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-01-11 11:43:57,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:57,500 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-01-11 11:43:57,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:43:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-01-11 11:43:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:43:57,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:57,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:43:57,501 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:43:57,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:57,501 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-01-11 11:43:57,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:57,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:57,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:57,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:57,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:57,569 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-11 11:43:57,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:57,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:57,570 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:43:57,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:43:57,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:57,570 INFO 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-11 11:43:57,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:43:57,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:43:57,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 11:43:57,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:43:57,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:57,610 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 18 treesize of output 21 [2019-01-11 11:43:57,612 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 21 treesize of output 27 [2019-01-11 11:43:57,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:43:57,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,629 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 25 treesize of output 51 [2019-01-11 11:43:57,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,640 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:43:57,641 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:57,676 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:57,699 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:57,719 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:57,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:57,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:43:57,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,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, 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-11 11:43:57,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,831 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-11 11:43:57,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:57,882 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-11 11:43:57,883 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:57,900 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:57,915 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:57,933 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:57,968 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-11 11:43:57,969 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-11 11:43:58,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:58,003 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-11 11:43:58,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:58,076 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-11 11:43:58,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:43:58,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:58,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:58,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:58,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:58,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:58,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:58,130 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:43:58,132 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 79 [2019-01-11 11:43:58,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:58,167 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-11 11:43:58,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-01-11 11:43:58,187 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-11 11:43:58,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:58,214 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-11 11:43:58,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:43:58,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:43:58,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:43:58,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:43:58,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:43:58,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:43:58,236 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-01-11 11:43:58,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:58,693 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-01-11 11:43:58,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:43:58,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:43:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:58,694 INFO L225 Difference]: With dead ends: 57 [2019-01-11 11:43:58,694 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:43:58,695 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-11 11:43:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:43:58,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-01-11 11:43:58,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 11:43:58,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-01-11 11:43:58,715 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-01-11 11:43:58,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:58,715 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-01-11 11:43:58,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:43:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-01-11 11:43:58,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:43:58,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:58,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:43:58,716 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:43:58,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:58,717 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-01-11 11:43:58,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:58,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:58,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:43:58,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:58,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:58,753 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-11 11:43:58,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:58,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:58,754 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:43:58,754 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-01-11 11:43:58,756 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:43:58,756 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:43:58,996 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:43:58,996 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:43:58,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:58,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:43:58,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:58,997 INFO 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-11 11:43:59,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:59,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:43:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:59,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:59,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:59,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:43:59,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:59,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:59,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:43:59,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:59,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:59,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:59,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:59,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:43:59,131 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:59,144 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:59,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:59,172 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 18 treesize of output 21 [2019-01-11 11:43:59,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 27 [2019-01-11 11:43:59,185 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 23 treesize of output 37 [2019-01-11 11:43:59,188 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 25 treesize of output 51 [2019-01-11 11:43:59,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:43:59,197 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:59,221 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:59,236 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:59,248 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:59,258 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:59,280 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-11 11:43:59,280 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 11:43:59,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:59,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:43:59,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:59,339 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-11 11:43:59,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-11 11:43:59,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:59,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:59,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:59,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:59,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:59,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:43:59,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:43:59,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:59,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:43:59,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 11:43:59,408 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-11 11:43:59,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:59,427 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-11 11:43:59,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:43:59,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:43:59,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:43:59,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:43:59,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:43:59,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:43:59,447 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-01-11 11:43:59,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:59,757 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-01-11 11:43:59,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:43:59,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:43:59,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:59,759 INFO L225 Difference]: With dead ends: 61 [2019-01-11 11:43:59,759 INFO L226 Difference]: Without dead ends: 60 [2019-01-11 11:43:59,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:43:59,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-11 11:43:59,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-01-11 11:43:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 11:43:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-01-11 11:43:59,770 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-01-11 11:43:59,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:59,771 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-01-11 11:43:59,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:43:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-01-11 11:43:59,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:43:59,771 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:59,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:43:59,772 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:43:59,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:59,772 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-01-11 11:43:59,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:59,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:59,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:59,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:59,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:59,841 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-11 11:43:59,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:59,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:59,842 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:43:59,842 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-01-11 11:43:59,847 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:43:59,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:00,015 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:00,015 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:44:00,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:00,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:00,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:00,016 INFO 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-11 11:44:00,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:00,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:00,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:00,049 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 18 treesize of output 21 [2019-01-11 11:44:00,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2019-01-11 11:44:00,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44: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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:44:00,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:44:00,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,105 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 27 treesize of output 62 [2019-01-11 11:44:00,105 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:00,132 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:00,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:00,157 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:00,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:00,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 11:44:00,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,208 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-11 11:44:00,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,252 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-11 11:44:00,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,302 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-11 11:44:00,303 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:00,316 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:00,330 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:00,347 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:00,470 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-11 11:44:00,471 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 11:44:00,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:00,490 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-11 11:44:00,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:00,520 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-11 11:44:00,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-11 11:44:00,535 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-11 11:44:00,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:00,544 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-11 11:44:00,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:00,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:44:00,563 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:00,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:44:00,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:44:00,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:44:00,564 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-01-11 11:44:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:00,712 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-01-11 11:44:00,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:44:00,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 11:44:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:00,714 INFO L225 Difference]: With dead ends: 53 [2019-01-11 11:44:00,714 INFO L226 Difference]: Without dead ends: 52 [2019-01-11 11:44:00,714 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-11 11:44:00,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-11 11:44:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-01-11 11:44:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 11:44:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-01-11 11:44:00,731 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-01-11 11:44:00,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:00,732 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-01-11 11:44:00,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:44:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-01-11 11:44:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:44:00,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:00,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:44:00,733 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:00,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:00,733 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-01-11 11:44:00,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:00,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:00,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:00,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:00,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:00,881 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-11 11:44:01,016 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-11 11:44:01,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:01,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:01,017 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:44:01,017 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-01-11 11:44:01,018 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:01,018 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:01,266 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:01,266 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:01,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:01,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:01,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:01,267 INFO 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-11 11:44:01,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:01,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:01,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:01,344 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 18 treesize of output 21 [2019-01-11 11:44:01,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, 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 27 [2019-01-11 11:44:01,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,357 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 23 treesize of output 37 [2019-01-11 11:44:01,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:44:01,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,468 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:44:01,468 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:01,496 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:01,511 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:01,522 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:01,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:01,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,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-11 11:44:01,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,592 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-11 11:44:01,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:44:01,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,700 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-11 11:44:01,700 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:01,714 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:01,730 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:01,747 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:01,819 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-11 11:44:01,820 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-11 11:44:01,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,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, 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-11 11:44:01,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:01,875 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-11 11:44:01,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:44:01,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:01,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,015 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-11 11:44:02,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:02,064 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-11 11:44:02,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-11 11:44:02,081 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-11 11:44:02,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:02,104 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-11 11:44:02,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:02,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:44:02,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:02,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:02,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:02,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:44:02,124 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-01-11 11:44:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:02,464 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-01-11 11:44:02,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:44:02,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:44:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:02,466 INFO L225 Difference]: With dead ends: 69 [2019-01-11 11:44:02,466 INFO L226 Difference]: Without dead ends: 68 [2019-01-11 11:44:02,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:44:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-11 11:44:02,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-01-11 11:44:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 11:44:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-01-11 11:44:02,476 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-01-11 11:44:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:02,476 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-01-11 11:44:02,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-01-11 11:44:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:44:02,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:02,477 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-11 11:44:02,478 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:02,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:02,478 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-01-11 11:44:02,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:02,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:02,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:02,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:02,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:02,584 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-11 11:44:02,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:02,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:02,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:44:02,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:44:02,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:02,585 INFO 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-11 11:44:02,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:44:02,595 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:44:02,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:44:02,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:44:02,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:02,622 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 18 treesize of output 21 [2019-01-11 11:44:02,626 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 21 treesize of output 27 [2019-01-11 11:44:02,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:44:02,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,650 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 25 treesize of output 51 [2019-01-11 11:44:02,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,663 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:44:02,664 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:02,831 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:02,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:02,861 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:02,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:02,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,897 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-11 11:44:02,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,928 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-11 11:44:02,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:02,968 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-11 11:44:03,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,038 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-11 11:44:03,039 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:03,056 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:03,072 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:03,088 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:03,119 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-11 11:44:03,119 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-01-11 11:44:03,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 11:44:03,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:03,171 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-11 11:44:03,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:44:03,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,199 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 78 [2019-01-11 11:44:03,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:03,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-11 11:44:03,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:50 [2019-01-11 11:44:03,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:03,265 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-11 11:44:03,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:03,297 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-11 11:44:03,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 11:44:03,313 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-11 11:44:03,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:03,334 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-11 11:44:03,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:03,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-11 11:44:03,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:03,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:44:03,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:44:03,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:44:03,353 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-01-11 11:44:03,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:03,696 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-01-11 11:44:03,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:44:03,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-11 11:44:03,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:03,698 INFO L225 Difference]: With dead ends: 73 [2019-01-11 11:44:03,698 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 11:44:03,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:44:03,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 11:44:03,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-01-11 11:44:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-11 11:44:03,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-01-11 11:44:03,711 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-01-11 11:44:03,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:03,711 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-01-11 11:44:03,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:44:03,711 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-01-11 11:44:03,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:44:03,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:03,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:44:03,713 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:03,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:03,713 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-01-11 11:44:03,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:03,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:03,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:44:03,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:03,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:03,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:03,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:03,825 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:44:03,825 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-01-11 11:44:03,826 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:03,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:04,087 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:04,087 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:04,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:04,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:04,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:04,088 INFO 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-11 11:44:04,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:04,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:04,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:44:04,116 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 21 treesize of output 23 [2019-01-11 11:44:04,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,126 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 23 treesize of output 33 [2019-01-11 11:44:04,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:44:04,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,156 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 27 treesize of output 62 [2019-01-11 11:44:04,156 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:04,191 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:04,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:04,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:04,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:04,246 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-11 11:44:04,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,261 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-11 11:44:04,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:44:04,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,352 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-11 11:44:04,353 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:04,368 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:04,383 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:04,399 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:04,425 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-11 11:44:04,426 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:44:04,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,526 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-11 11:44:04,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:04,555 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-11 11:44:04,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:44:04,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:04,583 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 76 [2019-01-11 11:44:04,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:04,613 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-11 11:44:04,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-01-11 11:44:04,632 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-11 11:44:04,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:04,648 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-11 11:44:04,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:04,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:44:04,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:04,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:04,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:04,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:44:04,667 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-01-11 11:44:05,106 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-11 11:44:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:05,404 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-01-11 11:44:05,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:44:05,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:44:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:05,406 INFO L225 Difference]: With dead ends: 84 [2019-01-11 11:44:05,406 INFO L226 Difference]: Without dead ends: 78 [2019-01-11 11:44:05,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:44:05,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-11 11:44:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-01-11 11:44:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-11 11:44:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-01-11 11:44:05,423 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-01-11 11:44:05,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:05,424 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-01-11 11:44:05,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:05,424 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-01-11 11:44:05,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:44:05,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:05,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:44:05,425 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:05,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:05,425 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-01-11 11:44:05,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:05,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:05,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:05,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:05,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:05,573 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-11 11:44:05,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:05,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:05,574 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:44:05,574 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-01-11 11:44:05,575 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:05,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:05,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:05,982 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:44:05,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:05,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:05,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:05,983 INFO 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-11 11:44:05,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:05,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:05,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:06,020 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 18 treesize of output 21 [2019-01-11 11:44:06,024 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 21 treesize of output 27 [2019-01-11 11:44:06,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:06,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:06,034 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 23 treesize of output 37 [2019-01-11 11:44:06,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:06,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:06,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:06,044 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 25 treesize of output 51 [2019-01-11 11:44:06,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:44:06,057 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:06,083 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:06,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:06,111 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:06,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:06,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:06,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:44:06,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:06,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:06,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:44:06,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:06,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:06,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:06,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:06,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:44:06,207 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:06,217 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:06,227 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:06,249 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-11 11:44:06,249 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 11:44:06,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:06,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, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-01-11 11:44:06,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:44:06,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:44:06,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:74 [2019-01-11 11:44:06,864 WARN L181 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-11 11:44:06,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:06,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:06,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:06,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:07,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:07,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:07,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:07,179 INFO L303 Elim1Store]: Index analysis took 309 ms [2019-01-11 11:44:07,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 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-11 11:44:07,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 11:44:08,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,356 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:08,357 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 45 treesize of output 51 [2019-01-11 11:44:08,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:08,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-11 11:44:08,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-01-11 11:44:08,600 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-01-11 11:44:08,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,615 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:08,619 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 86 [2019-01-11 11:44:08,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:08,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,713 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 55 treesize of output 53 [2019-01-11 11:44:08,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:08,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,790 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:08,791 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 82 [2019-01-11 11:44:08,792 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:08,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:08,878 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:08,878 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-11 11:44:08,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:08,946 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-11 11:44:08,946 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:121 [2019-01-11 11:44:09,074 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-11 11:44:09,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:09,141 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-11 11:44:09,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:09,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:44:09,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:09,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:44:09,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:44:09,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:44:09,163 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-01-11 11:44:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:10,008 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-01-11 11:44:10,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:44:10,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:44:10,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:10,011 INFO L225 Difference]: With dead ends: 109 [2019-01-11 11:44:10,011 INFO L226 Difference]: Without dead ends: 107 [2019-01-11 11:44:10,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:44:10,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-11 11:44:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-01-11 11:44:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 11:44:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-01-11 11:44:10,027 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-01-11 11:44:10,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:10,027 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-01-11 11:44:10,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:44:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-01-11 11:44:10,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:44:10,027 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:10,028 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:44:10,028 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:10,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:10,028 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-01-11 11:44:10,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:10,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:10,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:10,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:10,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:10,089 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-11 11:44:10,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:10,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:10,089 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:44:10,090 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-01-11 11:44:10,091 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:10,091 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:10,324 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:10,324 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:10,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:10,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:10,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:10,325 INFO 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-11 11:44:10,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:10,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:10,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:10,361 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 18 treesize of output 21 [2019-01-11 11:44:10,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, 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 27 [2019-01-11 11:44:10,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,374 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 23 treesize of output 37 [2019-01-11 11:44:10,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:44:10,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:44:10,401 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:10,425 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:10,438 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:10,451 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:10,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:10,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:44:10,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:44:10,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:44:10,548 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:10,559 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:10,568 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:10,590 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-11 11:44:10,590 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 11:44:10,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,666 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-11 11:44:10,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:10,704 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-11 11:44:10,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 11:44:10,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:10,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 11:44:10,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:10,755 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-11 11:44:10,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 11:44:10,772 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-11 11:44:10,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:10,794 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-11 11:44:10,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:10,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:44:10,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:10,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:10,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:10,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:44:10,814 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-01-11 11:44:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:11,177 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-01-11 11:44:11,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:44:11,178 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:44:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:11,179 INFO L225 Difference]: With dead ends: 77 [2019-01-11 11:44:11,179 INFO L226 Difference]: Without dead ends: 76 [2019-01-11 11:44:11,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:44:11,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-11 11:44:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-01-11 11:44:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-11 11:44:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-01-11 11:44:11,198 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-01-11 11:44:11,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:11,198 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-01-11 11:44:11,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-01-11 11:44:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:44:11,199 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:11,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:44:11,199 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:11,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:11,200 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-01-11 11:44:11,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:11,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:11,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:11,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:11,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:11,327 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-11 11:44:11,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:11,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:11,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:44:11,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:44:11,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:11,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:44:11,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:44:11,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:44:11,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:44:11,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:44:11,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:11,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,365 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-11 11:44:11,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,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, 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-11 11:44:11,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:44:11,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,483 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-11 11:44:11,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:11,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:11,515 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:11,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:11,557 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 18 treesize of output 21 [2019-01-11 11:44:11,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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:44:11,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, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:44:11,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, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:44:11,567 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:44:11,567 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:11,590 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:11,605 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:11,617 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:11,628 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:11,659 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-11 11:44:11,660 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 11:44:11,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,697 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-11 11:44:11,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:11,729 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-11 11:44:11,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:44:11,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,762 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:11,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-11 11:44:11,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:11,800 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-11 11:44:11,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-11 11:44:11,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:11,836 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 82 [2019-01-11 11:44:11,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:11,870 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-11 11:44:11,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-11 11:44:11,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-11 11:44:11,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:11,956 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-11 11:44:11,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:11,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:44:11,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:11,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:44:11,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:44:11,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:44:11,976 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-01-11 11:44:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:12,511 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-01-11 11:44:12,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:44:12,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:44:12,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:12,514 INFO L225 Difference]: With dead ends: 88 [2019-01-11 11:44:12,515 INFO L226 Difference]: Without dead ends: 83 [2019-01-11 11:44:12,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:44:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-11 11:44:12,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-01-11 11:44:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 11:44:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-11 11:44:12,533 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-11 11:44:12,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:12,533 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-11 11:44:12,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:44:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-11 11:44:12,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:44:12,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:12,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:44:12,534 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:12,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:12,535 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-01-11 11:44:12,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:12,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:12,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:44:12,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:12,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:12,800 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-11 11:44:12,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:12,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:12,800 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:44:12,800 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-01-11 11:44:12,801 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:12,802 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:13,073 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:13,073 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:13,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:13,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:13,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:13,074 INFO 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-11 11:44:13,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:13,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:13,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:44:13,166 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 21 treesize of output 23 [2019-01-11 11:44:13,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:13,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:13,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:44:13,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:13,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:13,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:13,340 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 25 treesize of output 47 [2019-01-11 11:44:13,470 INFO L303 Elim1Store]: Index analysis took 127 ms [2019-01-11 11:44:13,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, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:44:13,472 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:13,683 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:13,696 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:13,707 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:13,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:13,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 11:44:13,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:13,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:13,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 11:44:13,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:13,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:13,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:13,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:13,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:44:13,779 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:13,787 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:13,797 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:13,816 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-11 11:44:13,817 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-11 11:44:13,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:13,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:44:13,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:13,881 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-11 11:44:13,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 11:44:13,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:13,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:13,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:13,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:13,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:13,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:44:13,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:13,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-11 11:44:13,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-11 11:44:13,927 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-11 11:44:13,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:13,950 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-11 11:44:13,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:13,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:44:13,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:13,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:13,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:13,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:44:13,969 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-01-11 11:44:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:14,234 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-01-11 11:44:14,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:44:14,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:44:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:14,236 INFO L225 Difference]: With dead ends: 81 [2019-01-11 11:44:14,236 INFO L226 Difference]: Without dead ends: 80 [2019-01-11 11:44:14,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:44:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-11 11:44:14,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-01-11 11:44:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 11:44:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-11 11:44:14,252 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-11 11:44:14,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:14,252 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-11 11:44:14,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:14,252 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-11 11:44:14,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:44:14,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:14,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:44:14,253 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:14,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:14,253 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-01-11 11:44:14,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:14,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:14,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:14,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:14,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:14,416 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2019-01-11 11:44:14,477 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-11 11:44:14,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:14,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:14,478 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:44:14,478 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-01-11 11:44:14,479 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:14,479 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:15,112 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:15,113 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:44:15,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:15,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:15,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:15,114 INFO 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-11 11:44:15,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:15,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:15,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:15,319 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-11 11:44:15,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:44:15,530 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-11 11:44:15,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,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 27 treesize of output 42 [2019-01-11 11:44:15,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:44:15,570 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:15,579 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:15,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:15,605 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 18 treesize of output 21 [2019-01-11 11:44:15,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:44:15,610 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 23 treesize of output 37 [2019-01-11 11:44:15,612 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 25 treesize of output 51 [2019-01-11 11:44:15,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:44:15,618 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:15,635 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:15,649 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:15,661 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:15,671 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:15,692 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-11 11:44:15,693 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 11:44:15,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,760 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-11 11:44:15,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:15,777 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-11 11:44:15,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:44:15,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,805 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-11 11:44:15,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:15,828 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-11 11:44:15,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 11:44:15,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,856 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:15,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:15,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-11 11:44:15,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:15,881 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-11 11:44:15,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 11:44:15,897 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-11 11:44:15,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:15,944 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-11 11:44:15,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:15,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:44:15,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:15,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:44:15,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:44:15,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:44:15,966 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-01-11 11:44:16,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:16,490 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-01-11 11:44:16,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:44:16,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:44:16,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:16,493 INFO L225 Difference]: With dead ends: 113 [2019-01-11 11:44:16,493 INFO L226 Difference]: Without dead ends: 112 [2019-01-11 11:44:16,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:44:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-11 11:44:16,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-01-11 11:44:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-11 11:44:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-01-11 11:44:16,513 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-01-11 11:44:16,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:16,514 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-01-11 11:44:16,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:44:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-01-11 11:44:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:44:16,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:16,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:44:16,515 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:16,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:16,515 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-01-11 11:44:16,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:16,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:16,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:16,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:16,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:16,632 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-11 11:44:16,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:16,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:16,633 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:44:16,633 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-01-11 11:44:16,635 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:16,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:16,955 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:16,956 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:44:16,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:16,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:16,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:16,956 INFO 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-11 11:44:16,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:16,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:16,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:16,995 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 18 treesize of output 21 [2019-01-11 11:44:17,001 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 21 treesize of output 27 [2019-01-11 11:44:17,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,010 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 23 treesize of output 37 [2019-01-11 11:44:17,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:44:17,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:44:17,062 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:17,082 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:17,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:17,108 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:17,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:17,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:44:17,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:44:17,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:44:17,217 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:17,227 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:17,237 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:17,259 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-11 11:44:17,259 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 11:44:17,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:44:17,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 11:44:17,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-11 11:44:17,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:183 [2019-01-11 11:44:17,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,635 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:17,636 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 51 [2019-01-11 11:44:17,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:17,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,706 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 57 [2019-01-11 11:44:17,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:17,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-11 11:44:17,781 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:17,849 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-11 11:44:17,849 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:96 [2019-01-11 11:44:17,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:17,935 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 55 treesize of output 51 [2019-01-11 11:44:17,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:18,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,023 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:18,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 83 [2019-01-11 11:44:18,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:18,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:18,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-01-11 11:44:18,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:18,200 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-11 11:44:18,200 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-01-11 11:44:18,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-11 11:44:18,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:18,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:18,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-11 11:44:18,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:18,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:44:18,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:44:18,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:44:18,281 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-01-11 11:44:18,649 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-01-11 11:44:19,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:19,128 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-01-11 11:44:19,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:44:19,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:44:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:19,131 INFO L225 Difference]: With dead ends: 137 [2019-01-11 11:44:19,131 INFO L226 Difference]: Without dead ends: 136 [2019-01-11 11:44:19,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:44:19,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-11 11:44:19,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-01-11 11:44:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-11 11:44:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-01-11 11:44:19,162 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-01-11 11:44:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:19,162 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-01-11 11:44:19,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:44:19,163 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-01-11 11:44:19,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:44:19,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:19,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:44:19,164 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:19,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:19,164 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-01-11 11:44:19,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:19,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:19,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:19,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:19,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:19,274 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-11 11:44:19,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:19,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:19,274 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:44:19,274 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-01-11 11:44:19,275 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:19,276 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:19,977 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:19,978 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:19,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:19,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:19,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:19,978 INFO 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-11 11:44:19,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:19,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:20,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:20,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,068 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-11 11:44:20,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:44:20,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:44:20,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,190 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-11 11:44:20,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:20,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:20,223 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:20,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:20,262 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 18 treesize of output 21 [2019-01-11 11:44:20,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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:44:20,268 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 23 treesize of output 37 [2019-01-11 11:44:20,275 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 25 treesize of output 51 [2019-01-11 11:44:20,277 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:44:20,278 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:20,301 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:20,315 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:20,327 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:20,337 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:20,367 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-11 11:44:20,368 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-11 11:44:20,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,392 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-11 11:44:20,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:20,443 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-11 11:44:20,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:44:20,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:20,512 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:20,513 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-11 11:44:20,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:20,544 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-11 11:44:20,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-11 11:44:20,560 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-11 11:44:20,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:20,582 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-11 11:44:20,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:20,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:44:20,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:20,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:20,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:20,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:44:20,602 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-01-11 11:44:21,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:21,214 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-01-11 11:44:21,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:44:21,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:44:21,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:21,216 INFO L225 Difference]: With dead ends: 120 [2019-01-11 11:44:21,216 INFO L226 Difference]: Without dead ends: 119 [2019-01-11 11:44:21,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 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-11 11:44:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-11 11:44:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-01-11 11:44:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-11 11:44:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-01-11 11:44:21,253 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-01-11 11:44:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:21,253 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-01-11 11:44:21,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-01-11 11:44:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:44:21,254 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:21,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:44:21,255 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:21,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:21,255 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-01-11 11:44:21,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:21,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:21,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:21,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:21,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:21,483 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-11 11:44:21,624 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-11 11:44:21,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:21,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:21,625 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:44:21,626 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-01-11 11:44:21,627 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:21,627 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:23,086 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:23,087 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:44:23,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:23,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:23,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:23,087 INFO 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-11 11:44:23,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:23,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:23,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:23,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 18 treesize of output 21 [2019-01-11 11:44:23,116 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 21 treesize of output 23 [2019-01-11 11:44:23,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,124 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 23 treesize of output 33 [2019-01-11 11:44:23,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,142 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 25 treesize of output 47 [2019-01-11 11:44:23,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,153 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 27 treesize of output 62 [2019-01-11 11:44:23,154 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:23,192 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:23,211 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:23,224 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:23,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:23,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, 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-11 11:44:23,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,287 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-11 11:44:23,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,334 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-11 11:44:23,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,401 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-11 11:44:23,401 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:23,415 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:23,429 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:23,445 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:23,473 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-11 11:44:23,474 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 11:44:23,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:23,491 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-11 11:44:23,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:23,519 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-11 11:44:23,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-11 11:44:23,665 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-11 11:44:23,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:23,672 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-11 11:44:23,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:44:23,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 11:44:23,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:44:23,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:44:23,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:44:23,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:44:23,692 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-01-11 11:44:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:23,825 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-01-11 11:44:23,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:44:23,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 11:44:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:23,827 INFO L225 Difference]: With dead ends: 105 [2019-01-11 11:44:23,827 INFO L226 Difference]: Without dead ends: 104 [2019-01-11 11:44:23,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:44:23,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-11 11:44:23,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-01-11 11:44:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-11 11:44:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-01-11 11:44:23,875 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-01-11 11:44:23,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:23,875 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-01-11 11:44:23,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:44:23,875 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-01-11 11:44:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:44:23,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:23,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:44:23,876 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:23,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:23,876 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-01-11 11:44:23,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:23,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:23,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:23,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:23,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:24,472 WARN L181 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-01-11 11:44:24,935 WARN L181 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-01-11 11:44:24,955 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-11 11:44:24,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:24,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:24,956 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:44:24,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:44:24,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:24,957 INFO 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-11 11:44:24,965 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:44:24,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:44:24,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:44:24,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:44:24,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:24,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:44:24,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:44:24,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,000 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 23 treesize of output 37 [2019-01-11 11:44:25,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,006 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 25 treesize of output 51 [2019-01-11 11:44:25,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:44:25,015 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:25,034 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:25,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:25,060 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:25,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:25,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:44:25,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:44:25,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:44:25,155 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:25,165 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:25,175 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:25,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-11 11:44:25,197 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 11:44:25,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:44:25,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 11:44:25,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-01-11 11:44:25,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:183 [2019-01-11 11:44:25,561 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-01-11 11:44:25,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,573 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-11 11:44:25,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:25,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-11 11:44:25,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:25,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-11 11:44:25,761 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:25,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,838 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:25,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 51 [2019-01-11 11:44:25,839 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:25,899 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-11 11:44:25,900 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:173, output treesize:121 [2019-01-11 11:44:25,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:25,968 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 55 treesize of output 57 [2019-01-11 11:44:25,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:26,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,060 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:26,061 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 82 [2019-01-11 11:44:26,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:26,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,155 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:26,156 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-11 11:44:26,157 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:26,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:26,248 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:26,248 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 72 [2019-01-11 11:44:26,248 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:26,315 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-11 11:44:26,316 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-01-11 11:44:26,400 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-11 11:44:26,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:26,439 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-11 11:44:26,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:26,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:44:26,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:26,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:44:26,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:44:26,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:44:26,459 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-01-11 11:44:26,847 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-01-11 11:44:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:27,218 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-01-11 11:44:27,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:44:27,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:44:27,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:27,221 INFO L225 Difference]: With dead ends: 131 [2019-01-11 11:44:27,221 INFO L226 Difference]: Without dead ends: 130 [2019-01-11 11:44:27,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:44:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-11 11:44:27,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-01-11 11:44:27,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 11:44:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-01-11 11:44:27,248 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-01-11 11:44:27,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:27,248 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-01-11 11:44:27,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:44:27,249 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-01-11 11:44:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:44:27,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:27,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:44:27,249 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:27,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:27,250 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-01-11 11:44:27,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:27,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:27,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:44:27,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:27,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:27,448 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-01-11 11:44:27,464 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-11 11:44:27,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:27,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:27,465 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:44:27,465 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-01-11 11:44:27,466 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:27,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:27,992 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:27,993 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:27,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:27,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:27,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:27,993 INFO 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-11 11:44:28,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:28,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:28,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:28,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:44:28,024 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 21 treesize of output 23 [2019-01-11 11:44:28,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,035 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 23 treesize of output 33 [2019-01-11 11:44:28,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:44:28,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,065 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 27 treesize of output 62 [2019-01-11 11:44:28,066 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:28,105 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:28,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:28,141 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:28,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:28,180 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-11 11:44:28,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,202 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-11 11:44:28,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,256 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-11 11:44:28,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,318 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-11 11:44:28,319 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:28,336 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:28,353 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:28,371 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:28,419 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-11 11:44:28,419 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:44:28,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,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, 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-11 11:44:28,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:28,470 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-11 11:44:28,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:44:28,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:28,494 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:28,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 76 [2019-01-11 11:44:28,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:28,526 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-11 11:44:28,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-11 11:44:28,542 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-11 11:44:28,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:28,565 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-11 11:44:28,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:28,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:44:28,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:28,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:28,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:28,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:44:28,585 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-01-11 11:44:29,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:29,075 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-01-11 11:44:29,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:44:29,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:44:29,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:29,077 INFO L225 Difference]: With dead ends: 71 [2019-01-11 11:44:29,077 INFO L226 Difference]: Without dead ends: 68 [2019-01-11 11:44:29,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:44:29,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-11 11:44:29,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-01-11 11:44:29,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-11 11:44:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-01-11 11:44:29,101 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-01-11 11:44:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:29,102 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-01-11 11:44:29,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-01-11 11:44:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:44:29,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:29,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:44:29,102 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:29,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:29,102 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-01-11 11:44:29,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:29,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:29,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:29,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:29,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:29,214 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-11 11:44:29,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:29,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:29,215 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:44:29,215 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-01-11 11:44:29,216 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:29,216 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:29,427 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:29,428 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:29,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:29,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:29,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:29,428 INFO 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-11 11:44:29,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:29,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:29,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:29,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:29,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:44:29,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:29,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:29,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:44:29,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:29,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:29,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:29,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:29,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:44:29,542 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:29,551 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:29,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:29,575 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 18 treesize of output 21 [2019-01-11 11:44:29,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:44:29,579 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 23 treesize of output 37 [2019-01-11 11:44:29,599 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 25 treesize of output 51 [2019-01-11 11:44:29,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:44:29,610 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:29,628 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:29,641 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:29,651 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:29,661 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:29,682 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-11 11:44:29,683 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 11:44:29,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:29,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:44:29,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:29,725 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-11 11:44:29,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-11 11:44:29,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:29,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:29,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:29,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:29,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:29,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:29,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 11:44:29,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:29,769 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-11 11:44:29,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-11 11:44:29,786 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-11 11:44:29,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:29,798 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-11 11:44:29,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:29,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:44:29,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:29,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:29,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:29,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:44:29,818 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-01-11 11:44:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:30,087 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-01-11 11:44:30,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:44:30,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:44:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:30,089 INFO L225 Difference]: With dead ends: 73 [2019-01-11 11:44:30,089 INFO L226 Difference]: Without dead ends: 72 [2019-01-11 11:44:30,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:44:30,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-11 11:44:30,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-01-11 11:44:30,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 11:44:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-01-11 11:44:30,122 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-01-11 11:44:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:30,122 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-01-11 11:44:30,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-01-11 11:44:30,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:44:30,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:30,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:44:30,123 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:30,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:30,123 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-01-11 11:44:30,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:30,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:30,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:30,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:30,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:30,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:30,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:30,228 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:44:30,228 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-01-11 11:44:30,230 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:30,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:30,467 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:30,467 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:30,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:30,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:30,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:30,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 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-11 11:44:30,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:30,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:30,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:30,510 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 18 treesize of output 21 [2019-01-11 11:44:30,517 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 21 treesize of output 27 [2019-01-11 11:44:30,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,527 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 23 treesize of output 37 [2019-01-11 11:44:30,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,536 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 25 treesize of output 51 [2019-01-11 11:44:30,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:44:30,548 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:30,568 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:30,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:30,596 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:30,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:30,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:44:30,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:44:30,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:44:30,701 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:30,711 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:30,721 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:30,740 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-11 11:44:30,741 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 11:44:30,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:44:30,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:30,795 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-11 11:44:30,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 11:44:30,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:30,823 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:30,824 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-11 11:44:30,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:30,844 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-11 11:44:30,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-11 11:44:30,872 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-11 11:44:30,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:30,898 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-11 11:44:30,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:30,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-11 11:44:30,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:30,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:44:30,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:44:30,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:44:30,919 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-01-11 11:44:31,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:31,163 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-01-11 11:44:31,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:44:31,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-11 11:44:31,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:31,165 INFO L225 Difference]: With dead ends: 66 [2019-01-11 11:44:31,165 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 11:44:31,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:44:31,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 11:44:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-01-11 11:44:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-11 11:44:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-01-11 11:44:31,194 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-01-11 11:44:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:31,195 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-01-11 11:44:31,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:44:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-01-11 11:44:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:44:31,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:31,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:44:31,195 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:31,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:31,196 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-01-11 11:44:31,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:31,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:31,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:31,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:31,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:31,329 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-11 11:44:31,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:44:31,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 11:44:31,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:44:31,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:44:31,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:44:31,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:44:31,330 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-01-11 11:44:31,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:31,397 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-01-11 11:44:31,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:44:31,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 11:44:31,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:31,399 INFO L225 Difference]: With dead ends: 54 [2019-01-11 11:44:31,399 INFO L226 Difference]: Without dead ends: 51 [2019-01-11 11:44:31,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:44:31,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-11 11:44:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-01-11 11:44:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 11:44:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-01-11 11:44:31,443 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-01-11 11:44:31,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:31,443 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-01-11 11:44:31,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:44:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-01-11 11:44:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:44:31,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:31,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:44:31,444 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:31,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:31,445 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-01-11 11:44:31,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:31,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:31,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:31,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:31,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:31,659 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-11 11:44:31,692 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-11 11:44:31,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:31,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:31,693 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:44:31,693 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-01-11 11:44:31,695 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:31,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:31,898 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:31,898 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:31,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:31,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:31,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:31,898 INFO 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-11 11:44:31,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:31,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:31,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:31,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 11:44:31,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:31,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:31,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 11:44:31,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:31,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:31,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:31,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:31,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:44:31,986 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:31,998 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:32,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:32,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:44:32,024 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 21 treesize of output 23 [2019-01-11 11:44:32,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:44:32,029 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 25 treesize of output 47 [2019-01-11 11:44:32,036 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:44:32,036 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:32,053 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:32,065 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:32,075 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:32,085 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:32,104 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-11 11:44:32,104 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-11 11:44:32,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:32,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:44:32,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:44:32,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:44:32,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:62 [2019-01-11 11:44:32,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:32,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:32,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:32,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:32,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:44:32,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:32,249 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-11 11:44:32,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-11 11:44:32,262 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-11 11:44:32,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:32,273 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-11 11:44:32,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:32,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:44:32,292 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:32,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:32,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:32,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:44:32,293 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-01-11 11:44:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:32,543 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-01-11 11:44:32,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:44:32,543 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:44:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:32,544 INFO L225 Difference]: With dead ends: 83 [2019-01-11 11:44:32,545 INFO L226 Difference]: Without dead ends: 82 [2019-01-11 11:44:32,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:44:32,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-11 11:44:32,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-11 11:44:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-11 11:44:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-01-11 11:44:32,593 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-01-11 11:44:32,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:32,593 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-01-11 11:44:32,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:32,593 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-01-11 11:44:32,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:44:32,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:32,594 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 11:44:32,594 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:32,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:32,594 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-01-11 11:44:32,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:32,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:32,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:32,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:32,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:32,708 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-11 11:44:32,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:32,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:32,709 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:44:32,709 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-01-11 11:44:32,710 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:32,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:32,851 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:32,851 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:44:32,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:32,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:32,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:32,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 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-11 11:44:32,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:32,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:32,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:32,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 11:44:32,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:32,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:32,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 11:44:32,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:32,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:32,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:32,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:32,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:44:32,941 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:32,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:32,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:32,986 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 18 treesize of output 21 [2019-01-11 11:44:32,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, 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 23 [2019-01-11 11:44:32,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:44:32,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:44:33,003 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:44:33,004 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:33,020 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:33,032 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:33,042 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:33,050 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:33,069 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-11 11:44:33,070 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-11 11:44:33,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:33,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:44:33,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:33,106 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-11 11:44:33,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 11:44:33,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:33,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:33,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:33,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:33,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:33,127 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 40 [2019-01-11 11:44:33,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:33,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:33,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:20 [2019-01-11 11:44:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:33,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:33,180 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-11 11:44:33,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:33,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:44:33,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:33,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:33,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:33,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:44:33,201 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-01-11 11:44:33,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:33,602 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-01-11 11:44:33,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:44:33,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:44:33,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:33,604 INFO L225 Difference]: With dead ends: 86 [2019-01-11 11:44:33,604 INFO L226 Difference]: Without dead ends: 85 [2019-01-11 11:44:33,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:44:33,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-11 11:44:33,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-01-11 11:44:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-11 11:44:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-01-11 11:44:33,666 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-01-11 11:44:33,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:33,666 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-01-11 11:44:33,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:33,666 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-01-11 11:44:33,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:44:33,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:33,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:44:33,667 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:33,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:33,667 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-01-11 11:44:33,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:33,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:33,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:33,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:33,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:33,784 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-11 11:44:33,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:33,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:33,785 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:44:33,785 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-01-11 11:44:33,786 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:33,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:34,116 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:34,116 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:44:34,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:34,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:34,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:34,116 INFO 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-11 11:44:34,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:34,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:34,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:34,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,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, 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-11 11:44:34,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,207 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-11 11:44:34,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,247 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-11 11:44:34,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,302 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-11 11:44:34,302 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:34,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:34,339 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:34,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:34,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:44:34,389 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 21 treesize of output 27 [2019-01-11 11:44:34,391 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 23 treesize of output 37 [2019-01-11 11:44:34,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, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:44:34,397 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:44:34,398 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:34,431 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:34,447 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:34,458 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:34,468 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:34,500 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-11 11:44:34,500 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 11:44:34,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:44:34,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:34,574 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-11 11:44:34,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:44:34,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,647 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-11 11:44:34,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:34,680 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-11 11:44:34,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-11 11:44:34,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:34,711 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:34,712 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-11 11:44:34,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:34,746 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-11 11:44:34,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-11 11:44:34,791 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-11 11:44:34,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:34,991 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-11 11:44:35,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:35,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:44:35,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:35,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:44:35,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:44:35,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:44:35,011 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-01-11 11:44:35,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:35,549 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-01-11 11:44:35,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:44:35,550 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:44:35,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:35,551 INFO L225 Difference]: With dead ends: 100 [2019-01-11 11:44:35,551 INFO L226 Difference]: Without dead ends: 99 [2019-01-11 11:44:35,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:44:35,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-11 11:44:35,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-01-11 11:44:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-11 11:44:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-01-11 11:44:35,629 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-01-11 11:44:35,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:35,629 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-01-11 11:44:35,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:44:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-01-11 11:44:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:44:35,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:35,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:44:35,630 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:35,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:35,630 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-01-11 11:44:35,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:35,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:35,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:35,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:35,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:35,697 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-11 11:44:35,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:35,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:35,697 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:44:35,698 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-01-11 11:44:35,698 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:35,698 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:35,995 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:35,995 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:44:35,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:35,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:35,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:35,996 INFO 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-11 11:44:36,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:36,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:36,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:36,020 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-11 11:44:36,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,040 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-11 11:44:36,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,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, 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-11 11:44:36,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,145 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-11 11:44:36,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:36,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:36,180 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:36,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:36,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:44:36,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, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:44:36,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, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:44:36,230 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 25 treesize of output 47 [2019-01-11 11:44:36,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:44:36,233 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:36,256 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:36,269 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:36,279 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:36,290 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:36,318 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-11 11:44:36,319 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:44:36,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:44:36,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:36,381 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-11 11:44:36,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:44:36,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 11:44:36,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:36,429 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-11 11:44:36,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 11:44:36,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:36,456 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:36,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:44:36,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:36,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-11 11:44:36,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 11:44:36,496 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-11 11:44:36,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:36,537 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-11 11:44:36,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:36,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:44:36,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:36,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:44:36,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:44:36,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:44:36,557 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-01-11 11:44:37,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:37,063 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-01-11 11:44:37,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:44:37,063 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:44:37,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:37,065 INFO L225 Difference]: With dead ends: 104 [2019-01-11 11:44:37,065 INFO L226 Difference]: Without dead ends: 103 [2019-01-11 11:44:37,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:44:37,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-11 11:44:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-01-11 11:44:37,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-11 11:44:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-11 11:44:37,167 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-11 11:44:37,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:37,168 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-11 11:44:37,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:44:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-11 11:44:37,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:44:37,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:37,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:44:37,168 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:37,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:37,169 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-01-11 11:44:37,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:37,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:37,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:37,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:37,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:37,238 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-11 11:44:37,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:37,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:37,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:44:37,238 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-01-11 11:44:37,240 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:37,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:37,691 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:37,692 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:44:37,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:37,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:37,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:37,693 INFO 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-11 11:44:37,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:37,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:37,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:37,880 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-11 11:44:37,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:37,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:44:38,130 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-11 11:44:38,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:44:38,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:44:38,168 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:38,177 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:38,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:38,201 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 18 treesize of output 21 [2019-01-11 11:44:38,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:44:38,206 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 23 treesize of output 37 [2019-01-11 11:44:38,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:44:38,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:44:38,213 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:38,230 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:38,244 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:38,255 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:38,264 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:38,286 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-11 11:44:38,286 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 11:44:38,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:44:38,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:38,370 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-11 11:44:38,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:44:38,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 11:44:38,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:38,440 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-11 11:44:38,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 11:44:38,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:38,490 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:38,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 33 treesize of output 77 [2019-01-11 11:44:38,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:38,525 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-11 11:44:38,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 11:44:38,558 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-11 11:44:38,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:38,637 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-11 11:44:38,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:38,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:44:38,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:38,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:44:38,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:44:38,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:44:38,657 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-01-11 11:44:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:39,255 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-01-11 11:44:39,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:44:39,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:44:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:39,257 INFO L225 Difference]: With dead ends: 107 [2019-01-11 11:44:39,257 INFO L226 Difference]: Without dead ends: 106 [2019-01-11 11:44:39,258 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-11 11:44:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-11 11:44:39,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-01-11 11:44:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-11 11:44:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-11 11:44:39,372 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-11 11:44:39,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:39,372 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-11 11:44:39,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:44:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-11 11:44:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:44:39,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:39,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:44:39,373 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:39,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:39,374 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-01-11 11:44:39,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:39,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:39,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:39,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:39,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:39,424 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-11 11:44:39,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:39,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:39,424 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:44:39,424 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-01-11 11:44:39,425 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:39,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:39,677 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:39,678 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:39,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:39,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:39,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:39,678 INFO 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-11 11:44:39,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:39,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:39,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:39,709 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 18 treesize of output 21 [2019-01-11 11:44:39,714 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 21 treesize of output 23 [2019-01-11 11:44:39,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:44:39,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,742 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 25 treesize of output 47 [2019-01-11 11:44:39,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,756 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 27 treesize of output 62 [2019-01-11 11:44:39,756 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:39,784 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:39,798 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:39,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:39,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:39,841 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-11 11:44:39,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 11:44:39,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:44:39,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,941 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-11 11:44:39,941 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:39,957 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:39,971 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:39,987 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:40,016 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-11 11:44:40,017 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:44:40,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:40,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:44:40,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:40,090 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-11 11:44:40,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 11:44:40,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:40,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:40,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:40,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:40,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:40,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:40,115 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-11 11:44:40,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:40,135 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-11 11:44:40,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-11 11:44:40,153 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-11 11:44:40,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:40,174 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-11 11:44:40,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:40,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:44:40,194 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:40,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:40,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:40,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:44:40,195 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-01-11 11:44:40,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:40,586 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-01-11 11:44:40,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:44:40,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:44:40,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:40,588 INFO L225 Difference]: With dead ends: 100 [2019-01-11 11:44:40,588 INFO L226 Difference]: Without dead ends: 98 [2019-01-11 11:44:40,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 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-11 11:44:40,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-11 11:44:40,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-01-11 11:44:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-11 11:44:40,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-01-11 11:44:40,690 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-01-11 11:44:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:40,690 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-01-11 11:44:40,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-01-11 11:44:40,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:44:40,690 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:40,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:44:40,691 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:40,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:40,691 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-01-11 11:44:40,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:40,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:40,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:40,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:40,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:40,837 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-11 11:44:40,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:40,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:40,838 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:44:40,838 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-01-11 11:44:40,839 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:40,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:41,517 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:41,517 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:44:41,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:41,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:41,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:41,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 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-11 11:44:41,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:41,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:41,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:41,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:41,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 31 treesize of output 40 [2019-01-11 11:44:41,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:41,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:41,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:44:41,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:41,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:41,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:41,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:41,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:44:41,653 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:41,665 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:41,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:41,695 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 18 treesize of output 21 [2019-01-11 11:44:41,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:44:41,700 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 23 treesize of output 37 [2019-01-11 11:44:41,702 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 25 treesize of output 51 [2019-01-11 11:44:41,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:44:41,707 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:41,724 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:41,738 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:41,747 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:41,757 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:41,778 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-11 11:44:41,778 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 11:44:41,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:41,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, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:44:41,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 11:44:42,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-11 11:44:42,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:183 [2019-01-11 11:44:42,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,100 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:42,100 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 67 [2019-01-11 11:44:42,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:42,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:44:42,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:42,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,266 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:42,267 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 63 [2019-01-11 11:44:42,268 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:42,321 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-11 11:44:42,321 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:92 [2019-01-11 11:44:42,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 65 [2019-01-11 11:44:42,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:42,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-11 11:44:42,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:42,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,513 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:42,513 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 39 treesize of output 53 [2019-01-11 11:44:42,514 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:42,560 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-11 11:44:42,561 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:84 [2019-01-11 11:44:42,612 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-11 11:44:42,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:42,672 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-11 11:44:42,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:42,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:44:42,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:42,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:44:42,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:44:42,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:44:42,692 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-01-11 11:44:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:43,766 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-01-11 11:44:43,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:44:43,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:44:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:43,767 INFO L225 Difference]: With dead ends: 124 [2019-01-11 11:44:43,768 INFO L226 Difference]: Without dead ends: 123 [2019-01-11 11:44:43,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:44:43,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-11 11:44:43,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-01-11 11:44:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-11 11:44:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-01-11 11:44:43,896 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-01-11 11:44:43,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:43,896 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-01-11 11:44:43,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:44:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-01-11 11:44:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:44:43,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:43,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:44:43,897 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:43,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:43,897 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-01-11 11:44:43,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:43,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:43,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:43,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:43,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:44,043 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 11:44:44,061 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-11 11:44:44,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:44,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:44,061 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:44:44,061 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-01-11 11:44:44,064 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:44,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:44,787 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:44,787 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:44:44,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:44,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:44,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:44,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 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-11 11:44:44,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:44,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:44,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:44,886 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 18 treesize of output 21 [2019-01-11 11:44:44,888 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 21 treesize of output 27 [2019-01-11 11:44:44,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:44,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:44,895 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 23 treesize of output 37 [2019-01-11 11:44:44,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:44,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:44,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:44,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:44:44,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:44,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:44,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:44,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:44,909 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:44:44,910 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:44,937 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:44,953 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:44,964 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:44,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:45,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,003 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-11 11:44:45,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,037 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-11 11:44:45,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,077 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-11 11:44:45,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,128 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-11 11:44:45,129 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:45,146 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:45,162 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:45,178 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:45,209 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-11 11:44:45,209 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 11:44:45,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 11:44:45,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:45,273 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-11 11:44:45,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:44:45,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,305 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:45,306 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-11 11:44:45,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:45,340 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-11 11:44:45,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-11 11:44:45,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:45,372 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:45,373 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-11 11:44:45,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:45,404 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-11 11:44:45,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:44:45,430 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-11 11:44:45,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:45,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:45,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:44:45,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:45,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:44:45,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:44:45,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:44:45,488 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-01-11 11:44:46,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:46,071 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-01-11 11:44:46,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:44:46,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 11:44:46,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:46,073 INFO L225 Difference]: With dead ends: 114 [2019-01-11 11:44:46,073 INFO L226 Difference]: Without dead ends: 113 [2019-01-11 11:44:46,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:44:46,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-11 11:44:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-01-11 11:44:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-11 11:44:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-01-11 11:44:46,209 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-01-11 11:44:46,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:46,209 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-01-11 11:44:46,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:44:46,209 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-01-11 11:44:46,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:44:46,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:46,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:44:46,210 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:46,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:46,210 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-01-11 11:44:46,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:46,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:46,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:46,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:46,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:46,309 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-11 11:44:46,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:46,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:46,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:44:46,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:44:46,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:46,311 INFO 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-11 11:44:46,321 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:44:46,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:44:46,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:44:46,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:44:46,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:46,416 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 18 treesize of output 21 [2019-01-11 11:44:46,419 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 21 treesize of output 27 [2019-01-11 11:44:46,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,425 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 23 treesize of output 37 [2019-01-11 11:44:46,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,431 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 25 treesize of output 51 [2019-01-11 11:44:46,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:44:46,440 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:46,468 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:46,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:46,497 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:46,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:46,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,534 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-11 11:44:46,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:44:46,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,605 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-11 11:44:46,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,653 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-11 11:44:46,654 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:46,671 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:46,687 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:46,704 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:46,735 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-11 11:44:46,736 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-11 11:44:46,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,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, 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-11 11:44:46,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:46,791 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-11 11:44:46,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:44:46,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,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, 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-11 11:44:46,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:46,852 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-11 11:44:46,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-11 11:44:46,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:46,885 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:46,886 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-11 11:44:46,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:46,922 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-11 11:44:46,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-11 11:44:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:48,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:48,985 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-11 11:44:49,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:49,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:44:49,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:49,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:44:49,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:44:49,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=91, Unknown=1, NotChecked=0, Total=156 [2019-01-11 11:44:49,004 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-01-11 11:44:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:49,602 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-01-11 11:44:49,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:44:49,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:44:49,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:49,604 INFO L225 Difference]: With dead ends: 164 [2019-01-11 11:44:49,605 INFO L226 Difference]: Without dead ends: 163 [2019-01-11 11:44:49,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=73, Invalid=108, Unknown=1, NotChecked=0, Total=182 [2019-01-11 11:44:49,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-11 11:44:49,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-01-11 11:44:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-11 11:44:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-01-11 11:44:49,839 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-01-11 11:44:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:49,839 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-01-11 11:44:49,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:44:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-01-11 11:44:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:44:49,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:49,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:44:49,840 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:49,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:49,841 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-01-11 11:44:49,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:49,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:49,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:44:49,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:49,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:49,902 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-11 11:44:49,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:49,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:49,903 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:44:49,903 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-01-11 11:44:49,904 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:49,904 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:50,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:50,422 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:50,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:50,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:50,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:50,422 INFO 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-11 11:44:50,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:50,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:50,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:50,444 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-11 11:44:50,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:44:50,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:44:50,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,568 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-11 11:44:50,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,596 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,633 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 18 treesize of output 21 [2019-01-11 11:44:50,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, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:44:50,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, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:44:50,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:44:50,647 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 27 treesize of output 62 [2019-01-11 11:44:50,647 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,669 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,682 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,692 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,702 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,731 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-11 11:44:50,731 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:44:50,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,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-11 11:44:50,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,786 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-11 11:44:50,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:44:50,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,825 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-11 11:44:50,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:44:50,927 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-11 11:44:50,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-11 11:44:50,959 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-11 11:44:50,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:50,982 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-11 11:44:51,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:51,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:44:51,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:51,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:51,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:51,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:44:51,001 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-01-11 11:44:51,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:51,501 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-01-11 11:44:51,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:44:51,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:44:51,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:51,503 INFO L225 Difference]: With dead ends: 160 [2019-01-11 11:44:51,504 INFO L226 Difference]: Without dead ends: 159 [2019-01-11 11:44:51,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:44:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-11 11:44:51,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-01-11 11:44:51,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-11 11:44:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-01-11 11:44:51,745 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-01-11 11:44:51,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:51,745 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-01-11 11:44:51,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-01-11 11:44:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:44:51,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:51,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:44:51,747 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:51,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:51,747 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-01-11 11:44:51,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:51,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:51,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:51,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:51,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:51,840 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-11 11:44:51,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:51,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:51,841 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:44:51,841 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-01-11 11:44:51,842 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:51,843 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:52,204 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:52,204 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:52,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:52,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:52,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:52,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:44:52,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:52,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:52,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:52,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 18 treesize of output 21 [2019-01-11 11:44:52,303 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 21 treesize of output 23 [2019-01-11 11:44:52,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,312 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 23 treesize of output 33 [2019-01-11 11:44:52,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,320 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 25 treesize of output 47 [2019-01-11 11:44:52,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, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:44:52,331 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,349 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 11:44:52,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 11:44:52,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:44:52,446 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,455 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,464 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,484 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-11 11:44:52,484 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-11 11:44:52,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 11:44:52,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,529 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-11 11:44:52,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 11:44:52,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:44:52,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,564 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-11 11:44:52,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-11 11:44:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:52,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:52,596 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-11 11:44:52,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:52,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:44:52,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:52,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:52,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:52,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:44:52,616 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-01-11 11:44:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:53,151 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-01-11 11:44:53,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:44:53,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:44:53,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:53,153 INFO L225 Difference]: With dead ends: 175 [2019-01-11 11:44:53,153 INFO L226 Difference]: Without dead ends: 174 [2019-01-11 11:44:53,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:44:53,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-11 11:44:53,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-01-11 11:44:53,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-11 11:44:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-11 11:44:53,391 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-11 11:44:53,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:53,392 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-11 11:44:53,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:53,392 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-11 11:44:53,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:44:53,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:53,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:44:53,393 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:53,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:53,393 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-01-11 11:44:53,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:53,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:53,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:53,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:53,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:53,543 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-11 11:44:53,895 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-11 11:44:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:44:54,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:44:54,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:44:54,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:44:54,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:44:54,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:44:54,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:44:54,008 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-01-11 11:44:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:54,400 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-01-11 11:44:54,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:44:54,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-11 11:44:54,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:54,402 INFO L225 Difference]: With dead ends: 185 [2019-01-11 11:44:54,402 INFO L226 Difference]: Without dead ends: 184 [2019-01-11 11:44:54,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-11 11:44:54,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-11 11:44:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-01-11 11:44:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-11 11:44:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-11 11:44:54,641 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-11 11:44:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:54,642 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-11 11:44:54,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:44:54,642 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-11 11:44:54,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:44:54,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:54,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:44:54,643 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:54,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:54,643 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-01-11 11:44:54,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:54,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:54,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:54,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:54,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:54,702 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-11 11:44:54,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:54,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:54,703 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:44:54,703 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-01-11 11:44:54,704 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:54,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:54,930 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:54,930 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:54,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:54,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:54,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:54,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:44:54,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:54,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:54,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:54,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 11:44:54,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 11:44:55,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:44:55,012 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:55,024 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:55,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:55,045 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 18 treesize of output 21 [2019-01-11 11:44:55,049 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 21 treesize of output 23 [2019-01-11 11:44:55,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, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:44:55,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:44:55,085 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:44:55,085 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:55,100 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:55,113 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:55,122 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:55,132 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:55,152 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-11 11:44:55,152 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-11 11:44:55,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 11:44:55,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:55,194 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-11 11:44:55,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 11:44:55,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,213 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:55,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-01-11 11:44:55,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:55,225 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-11 11:44:55,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:44:55,238 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-11 11:44:55,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:55,259 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-11 11:44:55,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:55,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:44:55,279 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:55,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:55,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:55,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:44:55,279 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-01-11 11:44:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:55,751 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-01-11 11:44:55,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:44:55,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:44:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:55,754 INFO L225 Difference]: With dead ends: 142 [2019-01-11 11:44:55,754 INFO L226 Difference]: Without dead ends: 141 [2019-01-11 11:44:55,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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-11 11:44:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-11 11:44:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-01-11 11:44:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-11 11:44:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-01-11 11:44:55,996 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-01-11 11:44:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:55,997 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-01-11 11:44:55,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-01-11 11:44:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:44:55,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:55,997 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 11:44:55,998 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:55,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:55,998 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-01-11 11:44:55,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:55,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:55,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:55,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:55,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:56,105 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-11 11:44:56,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:56,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:56,106 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:44:56,106 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-01-11 11:44:56,107 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:56,107 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:56,604 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:56,604 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:56,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:56,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:56,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:56,605 INFO 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-11 11:44:56,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:56,614 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:56,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:56,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 18 treesize of output 21 [2019-01-11 11:44:56,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 21 treesize of output 23 [2019-01-11 11:44:56,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,644 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 23 treesize of output 33 [2019-01-11 11:44:56,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,654 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 25 treesize of output 47 [2019-01-11 11:44:56,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,669 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 27 treesize of output 62 [2019-01-11 11:44:56,670 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:56,704 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:56,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:56,729 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:56,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:56,761 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-11 11:44:56,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,779 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-11 11:44:56,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,815 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-11 11:44:56,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,862 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-11 11:44:56,862 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:56,876 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:56,890 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:56,907 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:56,936 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-11 11:44:56,937 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 11:44:56,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,967 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-11 11:44:56,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:44:57,067 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-11 11:44:57,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-11 11:44:57,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 11:44:57,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:57,138 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-11 11:44:57,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-01-11 11:44:57,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-11 11:44:57,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:57,203 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-11 11:44:57,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 11:44:57,220 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-11 11:44:57,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:57,270 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-11 11:44:57,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:57,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-11 11:44:57,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:57,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:44:57,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:44:57,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:44:57,290 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-01-11 11:44:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:58,012 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-01-11 11:44:58,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:44:58,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 11:44:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:58,015 INFO L225 Difference]: With dead ends: 219 [2019-01-11 11:44:58,015 INFO L226 Difference]: Without dead ends: 216 [2019-01-11 11:44:58,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:44:58,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-11 11:44:58,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-01-11 11:44:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-01-11 11:44:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-01-11 11:44:58,534 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-01-11 11:44:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:58,534 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-01-11 11:44:58,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:44:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-01-11 11:44:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:44:58,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:58,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:44:58,535 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:58,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:58,536 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-01-11 11:44:58,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:58,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:58,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:58,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:58,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:58,812 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-11 11:44:58,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:58,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:58,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:44:58,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:44:58,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:58,813 INFO 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-11 11:44:58,823 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:44:58,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:44:58,836 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:44:58,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:44:58,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:58,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:58,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:44:58,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:58,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:58,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:44:58,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:58,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:58,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:58,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:58,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:44:58,941 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:58,958 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:58,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:58,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:44:58,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, 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 27 [2019-01-11 11:44:58,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, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:44:58,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:44:59,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:44:59,007 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,031 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,050 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,065 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,081 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,111 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-11 11:44:59,111 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 11:44:59,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,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, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-01-11 11:44:59,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:44:59,231 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-11 11:44:59,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:75 [2019-01-11 11:44:59,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,291 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 50 treesize of output 80 [2019-01-11 11:44:59,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:44:59,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 74 [2019-01-11 11:44:59,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-11 11:44:59,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-01-11 11:44:59,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,556 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:59,572 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 4 case distinctions, treesize of input 42 treesize of output 88 [2019-01-11 11:44:59,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-01-11 11:44:59,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,743 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:59,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,745 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 65 [2019-01-11 11:44:59,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-01-11 11:44:59,854 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-11 11:44:59,950 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-01-11 11:45:00,059 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-11 11:45:00,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:00,105 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-11 11:45:00,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:00,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:45:00,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:00,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:45:00,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:45:00,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:45:00,125 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-01-11 11:45:01,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:01,314 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-01-11 11:45:01,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:45:01,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:45:01,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:01,318 INFO L225 Difference]: With dead ends: 218 [2019-01-11 11:45:01,318 INFO L226 Difference]: Without dead ends: 215 [2019-01-11 11:45:01,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:45:01,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-11 11:45:01,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-01-11 11:45:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-11 11:45:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-01-11 11:45:01,673 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-01-11 11:45:01,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:01,673 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-01-11 11:45:01,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:45:01,673 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-01-11 11:45:01,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:45:01,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:01,674 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:45:01,674 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:01,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:01,674 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-01-11 11:45:01,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:01,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:01,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:45:01,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:01,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:01,735 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-11 11:45:01,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:01,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:01,735 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:45:01,735 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-01-11 11:45:01,736 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:01,736 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:02,049 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:02,049 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:45:02,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:02,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:02,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:02,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 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-11 11:45:02,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:02,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:02,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:02,096 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-11 11:45:02,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,171 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-11 11:45:02,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:45:02,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,258 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-11 11:45:02,259 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,311 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,351 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 18 treesize of output 21 [2019-01-11 11:45:02,355 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 21 treesize of output 23 [2019-01-11 11:45:02,359 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 23 treesize of output 33 [2019-01-11 11:45:02,364 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 25 treesize of output 47 [2019-01-11 11:45:02,368 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 27 treesize of output 62 [2019-01-11 11:45:02,368 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,603 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,617 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,628 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,640 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,672 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-11 11:45:02,672 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 11:45:02,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,697 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-11 11:45:02,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,726 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-11 11:45:02,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:45:02,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,752 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-11 11:45:02,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,784 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-11 11:45:02,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-11 11:45:02,801 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-11 11:45:02,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:02,813 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-11 11:45:02,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:02,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:45:02,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:02,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:45:02,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:45:02,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:45:02,834 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-01-11 11:45:03,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:03,653 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-01-11 11:45:03,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:45:03,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:45:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:03,656 INFO L225 Difference]: With dead ends: 274 [2019-01-11 11:45:03,656 INFO L226 Difference]: Without dead ends: 269 [2019-01-11 11:45:03,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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-11 11:45:03,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-11 11:45:04,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-01-11 11:45:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-11 11:45:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-01-11 11:45:04,201 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-01-11 11:45:04,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:04,201 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-01-11 11:45:04,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:45:04,201 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-01-11 11:45:04,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:45:04,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:04,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:45:04,202 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:04,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:04,202 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-01-11 11:45:04,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:04,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:04,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:04,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:04,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:04,366 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-11 11:45:04,442 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-11 11:45:04,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:04,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:04,442 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:45:04,443 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-01-11 11:45:04,443 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:04,443 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:05,465 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:05,466 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:45:05,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:05,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:05,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:05,467 INFO 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-11 11:45:05,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:05,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:05,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:05,493 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 18 treesize of output 21 [2019-01-11 11:45:05,498 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 21 treesize of output 23 [2019-01-11 11:45:05,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,511 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 23 treesize of output 33 [2019-01-11 11:45:05,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:45:05,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,544 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 27 treesize of output 62 [2019-01-11 11:45:05,545 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:05,568 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:05,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:05,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:05,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:05,649 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-11 11:45:05,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,667 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-11 11:45:05,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,700 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-11 11:45:05,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,747 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-11 11:45:05,747 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:05,763 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:05,777 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:05,794 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:05,822 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-11 11:45:05,822 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:45:05,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,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, 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-11 11:45:05,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:05,876 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-11 11:45:05,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:45:05,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:05,912 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-11 11:45:05,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:45:06,013 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-11 11:45:06,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-11 11:45:06,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,068 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:06,068 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 83 [2019-01-11 11:45:06,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:06,092 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-11 11:45:06,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-11 11:45:06,109 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-11 11:45:06,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:06,126 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-11 11:45:06,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:06,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-11 11:45:06,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:06,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:45:06,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:45:06,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:45:06,146 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-01-11 11:45:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:07,717 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-01-11 11:45:07,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:45:07,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:45:07,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:07,722 INFO L225 Difference]: With dead ends: 480 [2019-01-11 11:45:07,722 INFO L226 Difference]: Without dead ends: 477 [2019-01-11 11:45:07,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:45:07,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-11 11:45:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-01-11 11:45:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-11 11:45:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-01-11 11:45:08,649 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-01-11 11:45:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:08,650 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-01-11 11:45:08,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:45:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-01-11 11:45:08,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:45:08,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:08,651 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 11:45:08,651 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:08,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:08,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-01-11 11:45:08,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:08,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:08,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:08,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:08,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:08,691 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-11 11:45:08,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:08,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:08,691 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:45:08,692 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-01-11 11:45:08,692 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:08,692 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:08,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:08,846 INFO L272 AbstractInterpreter]: Visited 6 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:45:08,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:08,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:08,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:08,846 INFO 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-11 11:45:08,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:08,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:08,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:08,865 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 18 treesize of output 21 [2019-01-11 11:45:08,869 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 21 treesize of output 23 [2019-01-11 11:45:08,898 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 23 treesize of output 25 [2019-01-11 11:45:08,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-11 11:45:08,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-11 11:45:08,923 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,931 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,953 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,971 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-11 11:45:08,971 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-11 11:45:08,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-11 11:45:08,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-11 11:45:08,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-01-11 11:45:08,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-01-11 11:45:08,992 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-11 11:45:08,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:08,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:09,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:45:09,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-01-11 11:45:09,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:45:09,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:45:09,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:45:09,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:45:09,016 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-01-11 11:45:10,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:10,983 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-01-11 11:45:10,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:45:10,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-11 11:45:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:10,990 INFO L225 Difference]: With dead ends: 804 [2019-01-11 11:45:10,990 INFO L226 Difference]: Without dead ends: 800 [2019-01-11 11:45:10,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:45:10,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-01-11 11:45:13,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-01-11 11:45:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-01-11 11:45:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-01-11 11:45:13,104 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-01-11 11:45:13,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:13,104 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-01-11 11:45:13,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:45:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-01-11 11:45:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:45:13,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:13,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:45:13,108 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:13,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:13,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-01-11 11:45:13,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:13,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:13,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:13,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:13,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:13,296 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-11 11:45:13,522 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-11 11:45:13,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:13,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:13,522 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:45:13,522 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-01-11 11:45:13,523 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:13,524 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:13,904 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:13,905 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:45:13,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:13,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:13,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:13,905 INFO 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-11 11:45:13,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:13,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:13,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:13,937 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 18 treesize of output 21 [2019-01-11 11:45:13,942 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 21 treesize of output 27 [2019-01-11 11:45:13,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,953 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 23 treesize of output 37 [2019-01-11 11:45:13,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,003 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 25 treesize of output 51 [2019-01-11 11:45:14,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,009 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:45:14,009 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:14,038 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:14,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:14,067 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:14,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:14,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,101 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-11 11:45:14,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 11:45:14,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:45:14,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,259 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-11 11:45:14,260 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:14,293 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:14,313 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:14,336 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:14,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:14,368 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-11 11:45:14,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,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, 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-11 11:45:14,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:14,454 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-11 11:45:14,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 11:45:14,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 11:45:14,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:14,556 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-11 11:45:14,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 11:45:14,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,624 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:14,625 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-11 11:45:14,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:14,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-11 11:45:14,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-11 11:45:14,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:14,729 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:14,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, 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-11 11:45:14,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:14,765 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-11 11:45:14,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-11 11:45:14,794 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-11 11:45:14,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:14,851 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-11 11:45:14,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:14,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:45:14,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:14,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:45:14,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:45:14,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:45:14,871 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-01-11 11:45:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:19,622 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-01-11 11:45:19,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:45:19,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:45:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:19,629 INFO L225 Difference]: With dead ends: 821 [2019-01-11 11:45:19,629 INFO L226 Difference]: Without dead ends: 820 [2019-01-11 11:45:19,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:45:19,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-01-11 11:45:21,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-01-11 11:45:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-01-11 11:45:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-01-11 11:45:21,636 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-01-11 11:45:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:21,637 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-01-11 11:45:21,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:45:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-01-11 11:45:21,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:45:21,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:21,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:45:21,640 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:21,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:21,640 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-01-11 11:45:21,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:21,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:21,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:21,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:21,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:21,690 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-11 11:45:21,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:21,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:21,691 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:45:21,691 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-01-11 11:45:21,692 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:21,692 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:21,920 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:21,921 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:45:21,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:21,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:21,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:21,921 INFO 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-11 11:45:21,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:21,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:21,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:21,941 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 17 treesize of output 20 [2019-01-11 11:45:21,945 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 20 treesize of output 22 [2019-01-11 11:45:21,961 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 22 treesize of output 24 [2019-01-11 11:45:21,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-11 11:45:21,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:22,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:22,016 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:22,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:22,040 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 18 treesize of output 21 [2019-01-11 11:45:22,043 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 21 treesize of output 23 [2019-01-11 11:45:22,047 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 23 treesize of output 25 [2019-01-11 11:45:22,056 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 25 treesize of output 27 [2019-01-11 11:45:22,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:45:22,063 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:22,076 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:22,086 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:22,096 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:22,106 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:22,124 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-11 11:45:22,124 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-01-11 11:45:22,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:22,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-11 11:45:22,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:22,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:22,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-11 11:45:22,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:22,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:22,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:22,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:22,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:45:22,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:22,175 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-11 11:45:22,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-11 11:45:22,186 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-11 11:45:22,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:22,208 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-11 11:45:22,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:22,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:45:22,227 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:22,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:45:22,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:45:22,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:45:22,228 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-01-11 11:45:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:24,407 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-01-11 11:45:24,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:45:24,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:45:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:24,415 INFO L225 Difference]: With dead ends: 805 [2019-01-11 11:45:24,415 INFO L226 Difference]: Without dead ends: 804 [2019-01-11 11:45:24,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 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-11 11:45:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-01-11 11:45:26,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-01-11 11:45:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-01-11 11:45:26,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-01-11 11:45:26,481 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-01-11 11:45:26,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:26,481 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-01-11 11:45:26,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:45:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-01-11 11:45:26,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:45:26,483 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:26,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:45:26,483 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:26,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:26,483 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-01-11 11:45:26,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:26,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:26,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:26,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:26,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:26,602 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-11 11:45:26,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:26,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:26,603 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:45:26,603 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-01-11 11:45:26,604 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:26,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:26,927 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:26,928 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:45:26,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:26,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:26,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:26,928 INFO 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-11 11:45:26,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:26,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:26,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:26,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:45:26,969 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 21 treesize of output 23 [2019-01-11 11:45:26,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:26,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:26,983 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 23 treesize of output 33 [2019-01-11 11:45:26,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:26,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:26,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:26,995 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 25 treesize of output 47 [2019-01-11 11:45:27,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,019 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 27 treesize of output 62 [2019-01-11 11:45:27,019 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,048 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,064 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,075 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,109 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-11 11:45:27,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,127 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-11 11:45:27,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,167 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-11 11:45:27,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,215 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-11 11:45:27,216 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,232 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,248 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,265 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,295 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-11 11:45:27,296 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:45:27,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,344 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-11 11:45:27,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,364 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-11 11:45:27,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:45:27,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 11:45:27,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,415 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-11 11:45:27,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 11:45:27,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,446 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:27,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 11:45:27,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,473 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-11 11:45:27,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 11:45:27,492 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-11 11:45:27,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:27,548 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-11 11:45:27,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:27,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:45:27,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:27,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:45:27,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:45:27,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:45:27,568 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-01-11 11:45:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:30,487 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-01-11 11:45:30,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:45:30,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:45:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:30,497 INFO L225 Difference]: With dead ends: 1004 [2019-01-11 11:45:30,498 INFO L226 Difference]: Without dead ends: 1003 [2019-01-11 11:45:30,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:45:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-01-11 11:45:32,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-01-11 11:45:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-01-11 11:45:32,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-01-11 11:45:32,758 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-01-11 11:45:32,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:32,759 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-01-11 11:45:32,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:45:32,759 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-01-11 11:45:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:45:32,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:32,761 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:45:32,762 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:32,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:32,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-01-11 11:45:32,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:32,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:32,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:32,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:32,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:32,914 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-11 11:45:32,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:32,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:32,915 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:45:32,915 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-01-11 11:45:32,916 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:32,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:33,132 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:33,132 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:45:33,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:33,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:33,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:33,133 INFO 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-11 11:45:33,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:33,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:33,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:33,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 11:45:33,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 11:45:33,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:45:33,220 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:33,228 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:33,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:33,250 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 18 treesize of output 21 [2019-01-11 11:45:33,254 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 21 treesize of output 23 [2019-01-11 11:45:33,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:45:33,261 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 25 treesize of output 47 [2019-01-11 11:45:33,267 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:45:33,268 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:33,283 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:33,295 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:33,305 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:33,315 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:33,335 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-11 11:45:33,336 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-11 11:45:33,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-01-11 11:45:33,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:33,382 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-11 11:45:33,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-01-11 11:45:33,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 11:45:33,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:45:33,474 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-11 11:45:33,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:46 [2019-01-11 11:45:33,509 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-11 11:45:33,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:33,524 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-11 11:45:33,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:33,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-11 11:45:33,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:33,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:45:33,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:45:33,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:45:33,544 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-01-11 11:45:36,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:36,956 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-01-11 11:45:36,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:45:36,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-11 11:45:36,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:36,967 INFO L225 Difference]: With dead ends: 1213 [2019-01-11 11:45:36,968 INFO L226 Difference]: Without dead ends: 1212 [2019-01-11 11:45:36,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:45:36,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-01-11 11:45:39,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-01-11 11:45:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-01-11 11:45:39,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-01-11 11:45:39,944 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-01-11 11:45:39,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:39,944 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-01-11 11:45:39,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:45:39,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-01-11 11:45:39,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:45:39,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:39,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:45:39,947 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:39,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:39,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-01-11 11:45:39,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:39,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:39,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:39,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:39,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:40,113 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-11 11:45:40,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:40,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:40,114 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:45:40,114 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-01-11 11:45:40,115 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:40,115 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:40,481 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:40,481 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:45:40,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:40,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:40,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:40,481 INFO 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-11 11:45:40,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:40,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:40,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:40,523 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 18 treesize of output 21 [2019-01-11 11:45:40,526 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 21 treesize of output 27 [2019-01-11 11:45:40,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:45:40,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,541 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 25 treesize of output 51 [2019-01-11 11:45:40,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,552 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:45:40,553 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:40,587 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:40,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:40,614 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:40,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:40,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 11:45:40,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,688 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-11 11:45:40,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:45:40,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,780 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-11 11:45:40,780 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:40,797 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:40,813 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:40,829 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:40,860 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-11 11:45:40,860 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 11:45:40,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,893 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-11 11:45:40,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:40,921 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-11 11:45:40,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:45:40,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:40,951 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:40,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, 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-11 11:45:40,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:40,983 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-11 11:45:40,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:42 [2019-01-11 11:45:41,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,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, 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 82 [2019-01-11 11:45:41,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:41,048 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-11 11:45:41,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-01-11 11:45:41,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,083 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:41,084 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 96 [2019-01-11 11:45:41,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:41,119 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-11 11:45:41,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:45:41,142 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-11 11:45:41,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:41,189 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-11 11:45:41,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:41,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:45:41,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:41,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:45:41,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:45:41,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:45:41,208 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-01-11 11:45:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:45,729 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-01-11 11:45:45,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:45:45,729 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:45:45,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:45,744 INFO L225 Difference]: With dead ends: 1577 [2019-01-11 11:45:45,744 INFO L226 Difference]: Without dead ends: 1575 [2019-01-11 11:45:45,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:45:45,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-01-11 11:45:47,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-01-11 11:45:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-01-11 11:45:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-01-11 11:45:47,851 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-01-11 11:45:47,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:47,851 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-01-11 11:45:47,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:45:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-01-11 11:45:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:45:47,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:47,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:45:47,852 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:47,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:47,852 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-01-11 11:45:47,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:47,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:47,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:47,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:47,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:48,003 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 11:45:48,171 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-11 11:45:48,192 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-11 11:45:48,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:48,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:48,192 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:45:48,193 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-01-11 11:45:48,193 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:48,193 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:48,532 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:48,533 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:45:48,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:48,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:48,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:48,533 INFO 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-11 11:45:48,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:48,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:48,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:48,573 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 18 treesize of output 21 [2019-01-11 11:45:48,576 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 21 treesize of output 27 [2019-01-11 11:45:48,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,582 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 23 treesize of output 37 [2019-01-11 11:45:48,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,592 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 25 treesize of output 51 [2019-01-11 11:45:48,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:45:48,604 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,629 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,654 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:45:48,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:45:48,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:45:48,746 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,756 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,765 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,785 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-11 11:45:48,786 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 11:45:48,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 11:45:48,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,851 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-11 11:45:48,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:45:48,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,877 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:48,878 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-11 11:45:48,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,898 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-11 11:45:48,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-11 11:45:48,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,925 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-11 11:45:48,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,945 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-11 11:45:48,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-11 11:45:48,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,976 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:48,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 11:45:48,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:49,002 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-11 11:45:49,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-11 11:45:49,021 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-11 11:45:49,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:49,071 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-11 11:45:49,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:49,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 11:45:49,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:49,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:45:49,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:45:49,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:45:49,091 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-01-11 11:45:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:52,619 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-01-11 11:45:52,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:45:52,619 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:45:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:52,627 INFO L225 Difference]: With dead ends: 1108 [2019-01-11 11:45:52,627 INFO L226 Difference]: Without dead ends: 1107 [2019-01-11 11:45:52,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:45:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-01-11 11:45:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-01-11 11:45:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-01-11 11:45:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-01-11 11:45:55,608 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-01-11 11:45:55,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:55,609 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-01-11 11:45:55,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:45:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-01-11 11:45:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:45:55,611 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:55,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:45:55,611 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:55,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-01-11 11:45:55,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:55,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:55,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:55,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:55,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:55,715 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-11 11:45:55,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:55,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:55,715 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:45:55,716 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-01-11 11:45:55,717 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:55,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:56,263 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:56,263 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:45:56,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:56,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:56,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:56,264 INFO 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-11 11:45:56,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:56,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:56,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:56,281 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 18 treesize of output 21 [2019-01-11 11:45:56,285 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 21 treesize of output 23 [2019-01-11 11:45:56,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,299 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 23 treesize of output 33 [2019-01-11 11:45:56,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:45:56,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:45:56,328 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,360 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,373 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,382 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,414 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-11 11:45:56,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,432 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-11 11:45:56,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,468 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-11 11:45:56,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,514 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-11 11:45:56,515 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,530 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,545 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,561 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,590 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-11 11:45:56,590 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:45:56,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,614 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-11 11:45:56,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,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-11 11:45:56,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:45:56,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,672 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:56,681 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 80 [2019-01-11 11:45:56,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:45:56,776 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-11 11:45:56,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-11 11:45:56,809 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-11 11:45:56,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:56,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:56,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:45:56,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:56,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:45:56,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:45:56,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:45:56,850 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-01-11 11:45:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:59,939 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-01-11 11:45:59,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:45:59,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:45:59,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:59,944 INFO L225 Difference]: With dead ends: 1075 [2019-01-11 11:45:59,945 INFO L226 Difference]: Without dead ends: 1074 [2019-01-11 11:45:59,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 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-11 11:45:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-01-11 11:46:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-01-11 11:46:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-01-11 11:46:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-01-11 11:46:02,899 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-01-11 11:46:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:02,899 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-01-11 11:46:02,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:46:02,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-01-11 11:46:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:46:02,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:02,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:46:02,901 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:02,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:02,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-01-11 11:46:02,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:02,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:02,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:02,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:02,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:02,984 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-11 11:46:02,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:02,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:02,985 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:46:02,985 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-01-11 11:46:02,986 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:02,986 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:03,743 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:03,743 INFO L272 AbstractInterpreter]: Visited 7 different actions 17 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:46:03,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:03,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:03,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:03,744 INFO 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-11 11:46:03,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:03,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:03,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:03,783 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 18 treesize of output 21 [2019-01-11 11:46:03,786 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 21 treesize of output 27 [2019-01-11 11:46:03,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:03,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:03,796 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 23 treesize of output 37 [2019-01-11 11:46:03,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:03,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:03,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:03,804 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 25 treesize of output 51 [2019-01-11 11:46:03,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:03,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:03,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:03,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:03,815 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:46:03,815 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:03,853 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:03,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:03,880 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:03,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:03,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:03,919 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-11 11:46:03,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:03,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:03,972 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-11 11:46:04,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,010 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-11 11:46:04,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,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-11 11:46:04,061 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:04,077 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:04,093 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:04,109 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:04,140 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-11 11:46:04,141 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 11:46:04,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,172 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-11 11:46:04,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:04,203 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-11 11:46:04,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:46:04,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,308 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:04,308 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-11 11:46:04,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:04,341 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-11 11:46:04,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-11 11:46:04,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 11:46:04,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:04,410 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-11 11:46:04,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-11 11:46:04,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:04,447 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:04,448 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-11 11:46:04,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:04,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:04,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-11 11:46:04,505 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-11 11:46:04,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:04,559 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-11 11:46:04,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:04,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:46:04,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:04,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:46:04,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:46:04,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:46:04,579 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-01-11 11:46:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:09,376 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-01-11 11:46:09,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:46:09,376 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:46:09,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:09,384 INFO L225 Difference]: With dead ends: 1522 [2019-01-11 11:46:09,384 INFO L226 Difference]: Without dead ends: 1521 [2019-01-11 11:46:09,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:46:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-01-11 11:46:12,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-01-11 11:46:12,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-01-11 11:46:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-01-11 11:46:12,594 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-01-11 11:46:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:12,595 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-01-11 11:46:12,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:46:12,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-01-11 11:46:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:46:12,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:12,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:46:12,597 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:12,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:12,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-01-11 11:46:12,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:12,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:12,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:12,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:12,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:12,713 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-11 11:46:12,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:12,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:12,714 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:46:12,714 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-01-11 11:46:12,715 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:12,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:13,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:13,952 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:46:13,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:13,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:13,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:13,952 INFO 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-11 11:46:13,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:13,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:13,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:13,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:46:13,973 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 21 treesize of output 23 [2019-01-11 11:46:13,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 11:46:14,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, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-11 11:46:14,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-11 11:46:14,027 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:14,034 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:14,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:14,086 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:14,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:14,111 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-11 11:46:14,112 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-11 11:46:14,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:14,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-11 11:46:14,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:14,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:14,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-11 11:46:14,124 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-11 11:46:14,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:14,134 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-11 11:46:14,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:46:14,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 11:46:14,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:46:14,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:46:14,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:46:14,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:46:14,155 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-01-11 11:46:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:18,304 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-01-11 11:46:18,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:46:18,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-11 11:46:18,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:18,312 INFO L225 Difference]: With dead ends: 1559 [2019-01-11 11:46:18,312 INFO L226 Difference]: Without dead ends: 1554 [2019-01-11 11:46:18,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:46:18,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-01-11 11:46:22,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-01-11 11:46:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-01-11 11:46:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-01-11 11:46:22,770 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-01-11 11:46:22,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:22,770 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-01-11 11:46:22,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:46:22,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-01-11 11:46:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:46:22,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:22,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:46:22,773 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:22,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:22,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-01-11 11:46:22,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:22,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:22,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:22,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:22,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:22,827 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-11 11:46:22,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:22,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:22,827 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:46:22,828 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-01-11 11:46:22,829 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:22,829 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:23,363 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:23,364 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:46:23,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:23,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:23,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:23,364 INFO 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-11 11:46:23,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:23,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:23,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:23,381 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 18 treesize of output 21 [2019-01-11 11:46:23,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2019-01-11 11:46:23,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,400 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 23 treesize of output 33 [2019-01-11 11:46:23,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:46:23,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:46:23,430 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,460 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,486 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,519 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-11 11:46:23,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,537 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-11 11:46:23,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,574 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-11 11:46:23,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,662 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-11 11:46:23,662 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,677 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,690 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,707 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,733 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-11 11:46:23,733 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:46:23,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,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 36 treesize of output 68 [2019-01-11 11:46:23,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,789 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-11 11:46:23,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:46:23,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,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, 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-11 11:46:23,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:46:23,936 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-11 11:46:23,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-11 11:46:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:23,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:23,997 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-11 11:46:24,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:24,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:46:24,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:24,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:46:24,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:46:24,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:46:24,017 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-01-11 11:46:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:28,501 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-01-11 11:46:28,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:46:28,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:46:28,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:28,510 INFO L225 Difference]: With dead ends: 1574 [2019-01-11 11:46:28,511 INFO L226 Difference]: Without dead ends: 1570 [2019-01-11 11:46:28,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:46:28,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-01-11 11:46:33,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-01-11 11:46:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-01-11 11:46:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-01-11 11:46:33,017 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-01-11 11:46:33,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:33,017 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-01-11 11:46:33,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:46:33,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-01-11 11:46:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:46:33,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:33,019 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 11:46:33,019 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:33,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:33,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-01-11 11:46:33,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:33,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:33,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:33,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:33,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:33,352 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-11 11:46:33,608 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-11 11:46:33,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:33,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:33,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:46:33,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:46:33,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:33,610 INFO 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-11 11:46:33,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:46:33,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:46:33,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:46:33,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:46:33,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:33,700 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 18 treesize of output 21 [2019-01-11 11:46:33,737 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 21 treesize of output 23 [2019-01-11 11:46:33,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:46:33,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,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 25 treesize of output 47 [2019-01-11 11:46:33,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,055 INFO L303 Elim1Store]: Index analysis took 131 ms [2019-01-11 11:46:34,055 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 27 treesize of output 62 [2019-01-11 11:46:34,056 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,204 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,219 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,227 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,260 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-11 11:46:34,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,278 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-11 11:46:34,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:46:34,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,364 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-11 11:46:34,365 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,380 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,395 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,411 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,440 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-11 11:46:34,440 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:46:34,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,468 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-11 11:46:34,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,496 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-11 11:46:34,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-11 11:46:34,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,538 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-11 11:46:34,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:46:34,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:46:34,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-11 11:46:34,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,688 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:34,689 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-11 11:46:34,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,716 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-11 11:46:34,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-01-11 11:46:34,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-11 11:46:34,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,774 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-11 11:46:34,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-11 11:46:34,795 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-11 11:46:34,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:34,841 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-11 11:46:34,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:34,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:46:34,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:34,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:46:34,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:46:34,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:46:34,860 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-01-11 11:46:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:41,116 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-01-11 11:46:41,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:46:41,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:46:41,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:41,122 INFO L225 Difference]: With dead ends: 2098 [2019-01-11 11:46:41,122 INFO L226 Difference]: Without dead ends: 2091 [2019-01-11 11:46:41,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:46:41,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-01-11 11:46:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-01-11 11:46:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-11 11:46:46,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-01-11 11:46:46,543 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-01-11 11:46:46,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:46,543 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-01-11 11:46:46,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:46:46,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-01-11 11:46:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:46:46,546 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:46,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:46:46,546 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:46,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:46,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-01-11 11:46:46,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:46,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:46,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:46:46,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:46,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:46,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:46,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:46,594 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:46:46,595 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-01-11 11:46:46,595 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:46,596 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:47,137 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:47,137 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:46:47,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:47,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:47,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:47,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 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-11 11:46:47,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:47,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:47,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:47,159 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 18 treesize of output 21 [2019-01-11 11:46:47,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2019-01-11 11:46:47,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,251 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 23 treesize of output 33 [2019-01-11 11:46:47,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,261 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 25 treesize of output 47 [2019-01-11 11:46:47,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,268 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 27 treesize of output 62 [2019-01-11 11:46:47,269 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,296 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,321 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,350 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-11 11:46:47,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,366 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-11 11:46:47,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,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, 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-11 11:46:47,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,448 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-11 11:46:47,448 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,462 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,477 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,493 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,522 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-11 11:46:47,522 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:46:47,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:46:47,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,579 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-11 11:46:47,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 11:46:47,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,603 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:47,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 11:46:47,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,624 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-11 11:46:47,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-11 11:46:47,640 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-11 11:46:47,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:47,694 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-11 11:46:47,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:47,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:46:47,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:47,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:46:47,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:46:47,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:46:47,713 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-01-11 11:46:53,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:53,039 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-01-11 11:46:53,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:46:53,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:46:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:53,044 INFO L225 Difference]: With dead ends: 1846 [2019-01-11 11:46:53,044 INFO L226 Difference]: Without dead ends: 1839 [2019-01-11 11:46:53,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 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-11 11:46:53,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-01-11 11:46:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-01-11 11:46:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-11 11:46:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-01-11 11:46:58,426 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-01-11 11:46:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:58,427 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-01-11 11:46:58,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:46:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-01-11 11:46:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:46:58,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:58,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:46:58,430 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:58,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:58,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-01-11 11:46:58,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:58,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:58,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:58,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:58,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:58,847 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-01-11 11:46:58,930 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-11 11:46:58,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:58,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:58,931 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:46:58,931 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-01-11 11:46:58,932 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:58,932 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:59,205 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:59,206 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:46:59,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:59,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:59,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:59,206 INFO 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-11 11:46:59,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:59,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:59,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:59,228 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 18 treesize of output 21 [2019-01-11 11:46:59,231 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 21 treesize of output 23 [2019-01-11 11:46:59,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,243 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 23 treesize of output 33 [2019-01-11 11:46:59,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:46:59,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,268 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 27 treesize of output 62 [2019-01-11 11:46:59,268 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,308 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,365 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-11 11:46:59,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:46:59,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,419 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-11 11:46:59,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,467 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-11 11:46:59,468 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,483 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,498 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,514 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,543 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-11 11:46:59,543 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:46:59,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,587 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-11 11:46:59,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:46:59,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:46:59,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:96 [2019-01-11 11:46:59,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,780 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 47 treesize of output 61 [2019-01-11 11:46:59,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 78 [2019-01-11 11:46:59,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:46:59,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:64 [2019-01-11 11:46:59,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,946 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:59,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-01-11 11:46:59,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:00,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:00,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:00,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:00,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:00,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:00,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:00,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:00,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:00,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:00,009 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:00,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:00,011 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-11 11:47:00,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:00,066 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-11 11:47:00,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-11 11:47:00,125 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-11 11:47:00,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:00,169 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-11 11:47:00,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:00,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-11 11:47:00,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:00,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:47:00,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:47:00,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:47:00,188 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-01-11 11:47:02,130 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-01-11 11:47:07,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:07,392 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-01-11 11:47:07,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:47:07,392 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:47:07,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:07,397 INFO L225 Difference]: With dead ends: 2193 [2019-01-11 11:47:07,398 INFO L226 Difference]: Without dead ends: 2192 [2019-01-11 11:47:07,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:47:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-01-11 11:47:13,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-01-11 11:47:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-01-11 11:47:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-01-11 11:47:13,279 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-01-11 11:47:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:13,279 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-01-11 11:47:13,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:47:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-01-11 11:47:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:47:13,282 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:13,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:47:13,282 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:13,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:13,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-01-11 11:47:13,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:13,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:13,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:13,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:13,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:13,440 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 11:47:13,581 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-11 11:47:14,022 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-11 11:47:14,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:14,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:14,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:47:14,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:47:14,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:14,024 INFO 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-11 11:47:14,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:47:14,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:47:14,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:47:14,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:47:14,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:14,253 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-11 11:47:14,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,280 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-11 11:47:14,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,330 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-11 11:47:14,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,373 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-11 11:47:14,539 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-01-11 11:47:14,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,551 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-11 11:47:14,552 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:14,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:14,586 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:14,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:14,631 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 18 treesize of output 21 [2019-01-11 11:47:14,633 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 21 treesize of output 27 [2019-01-11 11:47:14,635 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 23 treesize of output 37 [2019-01-11 11:47:14,638 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 25 treesize of output 51 [2019-01-11 11:47:14,640 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:47:14,641 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:14,665 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:14,679 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:14,690 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:14,701 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:14,731 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-11 11:47:14,732 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 11:47:14,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,762 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-11 11:47:14,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:14,792 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-11 11:47:14,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:47:14,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47: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 36 treesize of output 86 [2019-01-11 11:47:14,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:14,858 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-11 11:47:14,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-11 11:47:14,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,917 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:14,918 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-11 11:47:14,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:14,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-11 11:47:14,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-11 11:47:14,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:14,987 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:14,988 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-11 11:47:14,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:15,022 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-11 11:47:15,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-11 11:47:15,043 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-11 11:47:15,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:15,092 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-11 11:47:15,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:15,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:47:15,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:15,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:47:15,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:47:15,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:47:15,111 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-01-11 11:47:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:22,630 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-01-11 11:47:22,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:47:22,630 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:47:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:22,637 INFO L225 Difference]: With dead ends: 2526 [2019-01-11 11:47:22,637 INFO L226 Difference]: Without dead ends: 2520 [2019-01-11 11:47:22,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:47:22,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-01-11 11:47:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-01-11 11:47:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-01-11 11:47:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-01-11 11:47:28,640 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-01-11 11:47:28,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:28,640 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-01-11 11:47:28,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:47:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-01-11 11:47:28,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:47:28,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:28,644 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:47:28,644 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:28,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:28,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-01-11 11:47:28,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:28,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:28,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:47:28,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:28,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:28,850 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-11 11:47:29,096 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-11 11:47:29,116 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-11 11:47:29,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:29,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:29,117 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:47:29,117 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-01-11 11:47:29,118 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:47:29,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:47:29,324 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:47:29,324 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:47:29,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:29,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:47:29,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:29,325 INFO 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-11 11:47:29,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:29,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:47:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:29,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:29,347 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 18 treesize of output 21 [2019-01-11 11:47:29,353 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 21 treesize of output 23 [2019-01-11 11:47:29,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,366 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 23 treesize of output 33 [2019-01-11 11:47:29,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:47:29,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,392 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 27 treesize of output 62 [2019-01-11 11:47:29,393 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:29,427 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:29,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:29,449 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:29,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:29,480 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-11 11:47:29,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,498 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-11 11:47:29,622 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-01-11 11:47:29,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,631 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-11 11:47:29,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,680 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-11 11:47:29,680 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:29,696 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:29,710 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:29,727 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:29,756 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-11 11:47:29,756 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:47:29,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,794 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-11 11:47:29,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:47:29,891 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-11 11:47:29,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-01-11 11:47:29,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:29,933 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:29,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, 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-11 11:47:29,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:29,956 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-11 11:47:29,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-01-11 11:47:29,975 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-11 11:47:29,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:29,998 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-11 11:47:30,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:30,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-11 11:47:30,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:30,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:47:30,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:47:30,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:47:30,017 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-01-11 11:47:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:35,918 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-01-11 11:47:35,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:47:35,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-11 11:47:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:35,924 INFO L225 Difference]: With dead ends: 1971 [2019-01-11 11:47:35,924 INFO L226 Difference]: Without dead ends: 1964 [2019-01-11 11:47:35,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:47:35,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-01-11 11:47:41,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-01-11 11:47:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-01-11 11:47:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-01-11 11:47:41,945 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-01-11 11:47:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:41,945 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-01-11 11:47:41,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:47:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-01-11 11:47:41,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:47:41,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:41,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:47:41,950 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:41,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:41,950 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-01-11 11:47:41,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:41,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:41,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:41,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:41,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:42,109 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 11:47:42,160 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-11 11:47:42,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:42,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:42,161 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:47:42,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:47:42,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:42,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 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-11 11:47:42,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:47:42,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:47:42,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:47:42,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:47:42,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:42,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:47:42,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, 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 23 [2019-01-11 11:47:42,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,197 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 23 treesize of output 33 [2019-01-11 11:47:42,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:47:42,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,219 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 27 treesize of output 62 [2019-01-11 11:47:42,220 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:42,245 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:42,260 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:42,268 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:42,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:42,299 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-11 11:47:42,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:47:42,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,352 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-11 11:47:42,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,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-11 11:47:42,396 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:42,410 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:42,424 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:42,440 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:42,469 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-11 11:47:42,469 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:47:42,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:47:42,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:42,535 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-11 11:47:42,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:47:42,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,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 67 [2019-01-11 11:47:42,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:42,585 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-11 11:47:42,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 11:47:42,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:42,615 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:42,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-11 11:47:42,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:42,650 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-11 11:47:42,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 11:47:42,689 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-11 11:47:42,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:42,797 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-11 11:47:42,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:42,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:47:42,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:42,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:47:42,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:47:42,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:47:42,815 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-01-11 11:47:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:49,078 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-01-11 11:47:49,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:47:49,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-11 11:47:49,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:49,084 INFO L225 Difference]: With dead ends: 2036 [2019-01-11 11:47:49,084 INFO L226 Difference]: Without dead ends: 2033 [2019-01-11 11:47:49,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:47:49,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-01-11 11:47:55,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-01-11 11:47:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-01-11 11:47:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-01-11 11:47:55,324 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-01-11 11:47:55,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:55,324 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-01-11 11:47:55,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:47:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-01-11 11:47:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:47:55,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:55,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:47:55,327 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:55,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:55,328 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-01-11 11:47:55,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:55,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:55,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:47:55,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:55,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:55,402 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-11 11:47:55,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:55,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:55,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:47:55,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:47:55,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:55,404 INFO 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-11 11:47:55,413 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:47:55,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:47:55,421 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:47:55,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:47:55,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:55,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:55,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:47:55,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:55,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:55,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:47:55,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:55,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:55,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:55,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:55,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 11:47:55,527 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:55,539 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:55,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:55,582 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 18 treesize of output 21 [2019-01-11 11:47:55,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, 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 27 [2019-01-11 11:47:55,598 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 23 treesize of output 37 [2019-01-11 11:47:55,600 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 25 treesize of output 51 [2019-01-11 11:47:55,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:47:55,608 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:55,627 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:55,641 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:55,651 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:55,661 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:55,683 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-11 11:47:55,683 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 11:47:55,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:55,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-01-11 11:47:55,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:47:55,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-11 11:47:55,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:75 [2019-01-11 11:47:55,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:55,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:55,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:55,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:55,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:55,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:55,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:55,885 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 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-11 11:47:55,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 11:47:56,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,065 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:56,066 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 45 treesize of output 59 [2019-01-11 11:47:56,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:56,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-01-11 11:47:56,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-01-11 11:47:56,280 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-01-11 11:47:56,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,288 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 55 treesize of output 57 [2019-01-11 11:47:56,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:56,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,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, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-11 11:47:56,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:56,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,675 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:56,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 83 [2019-01-11 11:47:56,676 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:56,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,759 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:56,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,761 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 71 [2019-01-11 11:47:56,762 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:56,831 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-11 11:47:56,831 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-01-11 11:47:56,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,905 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:56,905 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 55 [2019-01-11 11:47:56,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:56,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-11 11:47:56,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:57,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,077 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:57,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,079 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 67 [2019-01-11 11:47:57,079 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:57,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 93 [2019-01-11 11:47:57,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:57,232 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-11 11:47:57,233 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-01-11 11:47:57,355 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-11 11:47:57,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:57,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-11 11:47:57,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:57,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:47:57,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:57,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:47:57,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:47:57,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:47:57,504 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-01-11 11:47:58,079 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-01-11 11:47:59,665 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-01-11 11:48:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:07,307 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-01-11 11:48:07,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:48:07,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:48:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:07,315 INFO L225 Difference]: With dead ends: 2952 [2019-01-11 11:48:07,316 INFO L226 Difference]: Without dead ends: 2951 [2019-01-11 11:48:07,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:48:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-01-11 11:48:12,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-01-11 11:48:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-01-11 11:48:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-01-11 11:48:12,883 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-01-11 11:48:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:12,883 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-01-11 11:48:12,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:48:12,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-01-11 11:48:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:48:12,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:12,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:48:12,886 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:48:12,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:12,886 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-01-11 11:48:12,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:12,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:48:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:12,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:13,039 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-11 11:48:13,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:13,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:48:13,040 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:48:13,040 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-01-11 11:48:13,040 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:48:13,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:48:13,249 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:48:13,250 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:48:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:13,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:48:13,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:13,250 INFO 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-11 11:48:13,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:13,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:48:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:13,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:48:13,270 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-11 11:48:13,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,302 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-11 11:48:13,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,364 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-11 11:48:13,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,436 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-11 11:48:13,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:13,457 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:13,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:13,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:13,520 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 18 treesize of output 21 [2019-01-11 11:48:13,526 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 21 treesize of output 23 [2019-01-11 11:48:13,530 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 23 treesize of output 33 [2019-01-11 11:48:13,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:48:13,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:48:13,541 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:13,569 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:13,581 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:13,594 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:13,604 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:13,637 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-11 11:48:13,638 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:48:13,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,692 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-11 11:48:13,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:48:13,793 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-11 11:48:13,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-11 11:48:13,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,867 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:48:13,867 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 49 treesize of output 59 [2019-01-11 11:48:13,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:13,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:13,934 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-11 11:48:13,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:13,995 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-11 11:48:13,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-01-11 11:48:14,057 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-11 11:48:14,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:48: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-11 11:48:14,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:48:14,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-11 11:48:14,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:48:14,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:48:14,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:48:14,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:48:14,100 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-01-11 11:48:14,680 WARN L181 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-01-11 11:48:14,886 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-01-11 11:48:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:20,998 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-01-11 11:48:20,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:48:20,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:48:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:21,004 INFO L225 Difference]: With dead ends: 1903 [2019-01-11 11:48:21,004 INFO L226 Difference]: Without dead ends: 1896 [2019-01-11 11:48:21,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:48:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-11 11:48:27,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-01-11 11:48:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-01-11 11:48:27,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-01-11 11:48:27,150 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-01-11 11:48:27,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:27,150 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-01-11 11:48:27,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:48:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-01-11 11:48:27,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:48:27,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:27,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:48:27,154 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:48:27,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:27,154 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-01-11 11:48:27,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:27,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:27,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:27,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:27,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:27,224 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-11 11:48:27,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:27,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:48:27,224 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:48:27,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:48:27,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:27,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:48:27,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:48:27,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:48:27,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 11:48:27,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:48:27,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:48:27,248 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 18 treesize of output 21 [2019-01-11 11:48:27,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2019-01-11 11:48:27,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,260 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 23 treesize of output 33 [2019-01-11 11:48:27,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,269 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 25 treesize of output 47 [2019-01-11 11:48:27,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,285 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 27 treesize of output 62 [2019-01-11 11:48:27,285 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:27,321 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:27,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:27,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:27,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:27,376 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-11 11:48:27,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,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 36 treesize of output 49 [2019-01-11 11:48:27,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,428 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-11 11:48:27,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,473 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-11 11:48:27,474 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:27,489 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:27,505 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:27,522 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:27,551 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-11 11:48:27,551 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:48:27,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,576 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-11 11:48:27,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:27,604 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-11 11:48:27,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:48:27,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:27,634 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:48:27,643 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 80 [2019-01-11 11:48:27,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:48:27,737 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-11 11:48:27,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-01-11 11:48:27,781 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-11 11:48:27,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:48:27,800 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-11 11:48:27,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:48:27,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:48:27,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:48:27,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:48:27,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:48:27,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:48:27,822 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-01-11 11:48:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:33,805 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-01-11 11:48:33,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:48:33,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:48:33,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:33,811 INFO L225 Difference]: With dead ends: 1884 [2019-01-11 11:48:33,811 INFO L226 Difference]: Without dead ends: 1877 [2019-01-11 11:48:33,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:48:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-01-11 11:48:40,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-01-11 11:48:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-01-11 11:48:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-01-11 11:48:40,074 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-01-11 11:48:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:40,075 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-01-11 11:48:40,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:48:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-01-11 11:48:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:48:40,078 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:40,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:48:40,078 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:48:40,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:40,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-01-11 11:48:40,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:40,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:40,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:48:40,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:40,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:40,199 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-11 11:48:40,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:40,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:48:40,200 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:48:40,200 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-01-11 11:48:40,201 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:48:40,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:48:40,495 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:48:40,496 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:48:40,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:40,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:48:40,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:40,496 INFO 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-11 11:48:40,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:40,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:48:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:40,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:48:40,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 11:48:40,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,541 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-11 11:48:40,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,592 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-11 11:48:40,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,644 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-11 11:48:40,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:40,660 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:40,677 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:40,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:40,735 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 18 treesize of output 21 [2019-01-11 11:48:40,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:48:40,766 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 23 treesize of output 33 [2019-01-11 11:48:40,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:48:40,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:48:40,772 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:40,794 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:40,807 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:40,818 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:40,828 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:40,856 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-11 11:48:40,856 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:48:40,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,881 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-11 11:48:40,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:40,907 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-11 11:48:40,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-11 11:48:40,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,934 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 76 [2019-01-11 11:48:40,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:40,964 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-11 11:48:40,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-11 11:48:40,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,997 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:48:41,007 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 94 [2019-01-11 11:48:41,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:48:41,109 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-11 11:48:41,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-11 11:48:41,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:41,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:48:41,174 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-11 11:48:41,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:48:41,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-11 11:48:41,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:48:41,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:48:41,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:48:41,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:48:41,194 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-01-11 11:48:50,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:50,598 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-01-11 11:48:50,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:48:50,598 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 11:48:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:50,607 INFO L225 Difference]: With dead ends: 2991 [2019-01-11 11:48:50,607 INFO L226 Difference]: Without dead ends: 2978 [2019-01-11 11:48:50,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:48:50,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-01-11 11:48:58,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-01-11 11:48:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-01-11 11:48:58,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-01-11 11:48:58,715 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-01-11 11:48:58,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:58,715 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-01-11 11:48:58,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:48:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-01-11 11:48:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:48:58,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:58,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:48:58,720 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:48:58,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:58,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-01-11 11:48:58,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:58,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:58,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:58,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:58,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:58,845 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-11 11:48:58,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:58,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:48:58,846 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:48:58,846 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-01-11 11:48:58,847 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:48:58,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:48:59,284 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:48:59,284 INFO L272 AbstractInterpreter]: Visited 8 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2019-01-11 11:48:59,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:59,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:48:59,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:59,284 INFO 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-11 11:48:59,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:59,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:48:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:59,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:48:59,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,331 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-11 11:48:59,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,377 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-11 11:48:59,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,416 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-11 11:48:59,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,486 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-11 11:48:59,487 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,533 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,581 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 18 treesize of output 21 [2019-01-11 11:48:59,587 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 21 treesize of output 27 [2019-01-11 11:48:59,590 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 23 treesize of output 37 [2019-01-11 11:48:59,592 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 25 treesize of output 51 [2019-01-11 11:48:59,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:48:59,596 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,631 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,651 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,667 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,679 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,718 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-11 11:48:59,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,769 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-11 11:48:59,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,806 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-11 11:48:59,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 11:48:59,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,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, 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-11 11:48:59,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,876 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-11 11:48:59,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 11:48:59,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,914 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:48:59,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, 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-11 11:48:59,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,952 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-11 11:48:59,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-11 11:48:59,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,989 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:48:59,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,991 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-11 11:48:59,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:00,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:49:00,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-01-11 11:49:00,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:00,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:00,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:00,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:00,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:00,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:00,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:00,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:00,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:00,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:00,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:00,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:00,066 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:49:00,067 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 96 [2019-01-11 11:49:00,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:00,104 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-11 11:49:00,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-11 11:49:00,135 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-11 11:49:00,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:49:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:00,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:49:00,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-11 11:49:00,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:49:00,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:49:00,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:49:00,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:49:00,832 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-01-11 11:49:11,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:49:11,801 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-01-11 11:49:11,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:49:11,801 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-11 11:49:11,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:49:11,810 INFO L225 Difference]: With dead ends: 3181 [2019-01-11 11:49:11,811 INFO L226 Difference]: Without dead ends: 3179 [2019-01-11 11:49:11,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:49:11,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-01-11 11:49:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-01-11 11:49:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-11 11:49:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-01-11 11:49:19,932 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-01-11 11:49:19,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:49:19,932 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-01-11 11:49:19,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:49:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-01-11 11:49:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:49:19,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:49:19,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:49:19,936 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:49:19,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:19,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-01-11 11:49:19,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:49:19,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:19,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:49:19,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:19,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:49:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:49:20,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:49:20,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:49:20,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:49:20,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:49:20,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:49:20,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:49:20,073 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-01-11 11:49:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:49:27,743 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-01-11 11:49:27,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:49:27,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-11 11:49:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:49:27,750 INFO L225 Difference]: With dead ends: 2346 [2019-01-11 11:49:27,750 INFO L226 Difference]: Without dead ends: 2337 [2019-01-11 11:49:27,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-11 11:49:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-01-11 11:49:36,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-01-11 11:49:36,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-11 11:49:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-01-11 11:49:36,040 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-01-11 11:49:36,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:49:36,040 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-01-11 11:49:36,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:49:36,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-01-11 11:49:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:49:36,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:49:36,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:49:36,045 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:49:36,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:36,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-01-11 11:49:36,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:49:36,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:36,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:49:36,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:36,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:49:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:36,189 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-11 11:49:36,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:36,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:49:36,190 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:49:36,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:49:36,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:36,190 INFO 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-11 11:49:36,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:49:36,200 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:49:36,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 11:49:36,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:49:36,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:49:36,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,255 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-11 11:49:36,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,289 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-11 11:49:36,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,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 32 treesize of output 61 [2019-01-11 11:49:36,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,381 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-11 11:49:36,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:36,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:36,414 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:36,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:36,454 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 18 treesize of output 21 [2019-01-11 11:49:36,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:49:36,459 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 23 treesize of output 37 [2019-01-11 11:49:36,461 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 25 treesize of output 51 [2019-01-11 11:49:36,465 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:49:36,465 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:36,489 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:36,503 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:36,514 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:36,524 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:36,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:36,555 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-11 11:49:36,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,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 36 treesize of output 66 [2019-01-11 11:49:36,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:36,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:49:36,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 11:49:36,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,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, 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-11 11:49:36,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:36,714 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-11 11:49:36,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 11:49:36,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,971 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:49:36,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:36,988 INFO L303 Elim1Store]: Index analysis took 247 ms [2019-01-11 11:49:36,989 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-11 11:49:36,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:37,185 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-11 11:49:37,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2019-01-11 11:49:37,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,227 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:49:37,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 96 [2019-01-11 11:49:37,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:37,265 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-11 11:49:37,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:49:37,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:37,304 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:49:37,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, 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 96 [2019-01-11 11:49:37,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:37,342 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-11 11:49:37,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-11 11:49:37,369 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-11 11:49:37,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:49:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:37,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:49:37,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-11 11:49:37,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:49:37,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:49:37,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:49:37,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:49:37,478 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-01-11 11:49:45,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:49:45,738 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-01-11 11:49:45,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:49:45,739 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-11 11:49:45,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:49:45,746 INFO L225 Difference]: With dead ends: 2345 [2019-01-11 11:49:45,746 INFO L226 Difference]: Without dead ends: 2338 [2019-01-11 11:49:45,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:49:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-01-11 11:49:48,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-01-11 11:49:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-01-11 11:49:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-01-11 11:49:48,013 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-01-11 11:49:48,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:49:48,014 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-01-11 11:49:48,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:49:48,014 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-01-11 11:49:48,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:49:48,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:49:48,015 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-11 11:49:48,015 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:49:48,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:48,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-01-11 11:49:48,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:49:48,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:48,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:49:48,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:48,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:49:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:48,076 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-11 11:49:48,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:48,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:49:48,076 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:49:48,076 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-01-11 11:49:48,077 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:49:48,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:49:48,370 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:49:48,370 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:49:48,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:48,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:49:48,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:48,371 INFO 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-11 11:49:48,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:49:48,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:49:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:48,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:49:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:49:48,398 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 21 treesize of output 23 [2019-01-11 11:49:48,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:49:48,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,421 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 25 treesize of output 47 [2019-01-11 11:49:48,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, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:49:48,433 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:48,463 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:48,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:48,489 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:48,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:48,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 11:49:48,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 11:49:48,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,656 INFO L303 Elim1Store]: Index analysis took 102 ms [2019-01-11 11:49:48,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:49:48,657 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:48,695 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:48,704 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:48,723 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-11 11:49:48,723 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-11 11:49:48,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:49:48,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:48,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:48,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-11 11:49:48,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:49:48,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:48,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:48,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-01-11 11:49:48,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,817 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-01-11 11:49:48,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:48,835 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-11 11:49:48,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:16 [2019-01-11 11:49:48,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:48,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, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-01-11 11:49:48,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:48,880 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-11 11:49:48,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2019-01-11 11:49:48,897 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-11 11:49:48,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:49:48,938 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-11 11:49:48,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:49:48,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 11:49:48,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:49:48,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:49:48,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:49:48,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:49:48,957 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-01-11 11:49:51,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:49:51,388 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-01-11 11:49:51,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:49:51,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 11:49:51,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:49:51,391 INFO L225 Difference]: With dead ends: 480 [2019-01-11 11:49:51,391 INFO L226 Difference]: Without dead ends: 477 [2019-01-11 11:49:51,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:49:51,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-11 11:49:52,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-01-11 11:49:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-11 11:49:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-01-11 11:49:52,383 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-01-11 11:49:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:49:52,383 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-01-11 11:49:52,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:49:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-01-11 11:49:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:49:52,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:49:52,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:49:52,384 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:49:52,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:52,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-01-11 11:49:52,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:49:52,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:52,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:49:52,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:52,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:49:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:52,450 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-11 11:49:52,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:52,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:49:52,451 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:49:52,451 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-01-11 11:49:52,452 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:49:52,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:49:52,748 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:49:52,748 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:49:52,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:52,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:49:52,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:52,749 INFO 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-11 11:49:52,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:49:52,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:49:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:52,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:49:52,796 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 18 treesize of output 21 [2019-01-11 11:49:52,801 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 21 treesize of output 23 [2019-01-11 11:49:52,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:52,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:52,809 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 23 treesize of output 33 [2019-01-11 11:49:52,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:52,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:52,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:52,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:49:52,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:52,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:52,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:52,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:52,840 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 27 treesize of output 62 [2019-01-11 11:49:52,841 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:52,869 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:52,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:52,895 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:52,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:52,926 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-11 11:49:52,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:52,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:52,943 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-11 11:49:52,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:52,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:52,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:52,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:52,991 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-11 11:49:53,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,038 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-11 11:49:53,039 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:53,054 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:53,069 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:53,085 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:53,113 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-11 11:49:53,114 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:49:53,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:49:53,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:53,169 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-11 11:49:53,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:49:53,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,195 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-11 11:49:53,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:53,218 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-11 11:49:53,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 11:49:53,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:53,247 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:49:53,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-11 11:49:53,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:53,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:49:53,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 11:49:53,291 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-11 11:49:53,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:49:53,322 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-11 11:49:53,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:49:53,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:49:53,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:49:53,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:49:53,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:49:53,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:49:53,342 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-01-11 11:49:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:49:55,295 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-01-11 11:49:55,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:49:55,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 11:49:55,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:49:55,297 INFO L225 Difference]: With dead ends: 250 [2019-01-11 11:49:55,297 INFO L226 Difference]: Without dead ends: 243 [2019-01-11 11:49:55,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:49:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-11 11:49:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-01-11 11:49:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-11 11:49:56,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-01-11 11:49:56,867 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-01-11 11:49:56,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:49:56,867 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-01-11 11:49:56,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:49:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-01-11 11:49:56,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:49:56,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:49:56,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:49:56,868 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:49:56,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:56,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-01-11 11:49:56,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:49:56,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:56,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:49:56,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:56,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:49:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:56,976 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-11 11:49:56,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:56,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:49:56,976 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:49:56,976 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-01-11 11:49:56,977 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:49:56,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:49:57,258 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:49:57,258 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:49:57,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:57,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:49:57,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:57,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 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-11 11:49:57,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:49:57,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:49:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:57,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:49:57,276 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 18 treesize of output 21 [2019-01-11 11:49:57,282 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 21 treesize of output 23 [2019-01-11 11:49:57,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,294 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 23 treesize of output 33 [2019-01-11 11:49:57,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:49:57,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, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:49:57,332 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:57,350 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:57,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:57,372 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:57,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:57,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 11:49:57,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 11:49:57,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:49:57,452 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:57,461 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:57,470 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:57,490 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-11 11:49:57,491 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-11 11:49:57,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:49:57,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:57,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:57,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-11 11:49:57,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:49:57,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:57,571 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-11 11:49:57,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-11 11:49:57,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,594 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:49:57,595 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 56 [2019-01-11 11:49:57,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:57,612 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-11 11:49:57,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-11 11:49:57,627 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-11 11:49:57,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:49:57,660 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-11 11:49:57,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:49:57,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:49:57,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:49:57,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:49:57,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:49:57,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:49:57,680 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-01-11 11:50:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:50:01,035 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-01-11 11:50:01,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:50:01,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 11:50:01,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:50:01,037 INFO L225 Difference]: With dead ends: 372 [2019-01-11 11:50:01,037 INFO L226 Difference]: Without dead ends: 362 [2019-01-11 11:50:01,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:50:01,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-01-11 11:50:03,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-01-11 11:50:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-01-11 11:50:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-01-11 11:50:03,443 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-01-11 11:50:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:50:03,443 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-01-11 11:50:03,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:50:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-01-11 11:50:03,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:50:03,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:50:03,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:50:03,445 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:50:03,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:03,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-01-11 11:50:03,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:50:03,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:03,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:50:03,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:03,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:50:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:03,537 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-11 11:50:03,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:03,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:50:03,538 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:50:03,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:50:03,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:03,538 INFO 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-11 11:50:03,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:50:03,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:50:03,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:50:03,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:50:03,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:50:03,564 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 18 treesize of output 21 [2019-01-11 11:50:03,569 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 21 treesize of output 23 [2019-01-11 11:50:03,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:50:03,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:50:03,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,608 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 27 treesize of output 62 [2019-01-11 11:50:03,609 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:03,637 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:03,653 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:03,664 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:03,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:03,696 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-11 11:50:03,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,713 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-11 11:50:03,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:50:03,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,798 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-11 11:50:03,798 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:03,820 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:03,834 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:03,851 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:03,879 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-11 11:50:03,879 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:50:03,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 11:50:03,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:03,932 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-11 11:50:03,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:50:03,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:03,959 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:50:03,968 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 80 [2019-01-11 11:50:03,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:50:04,064 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-11 11:50:04,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-11 11:50:04,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:04,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:04,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:04,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:04,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:04,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:04,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:04,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, 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-11 11:50:04,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:04,148 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-11 11:50:04,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-01-11 11:50:04,164 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-11 11:50:04,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:50:04,214 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-11 11:50:04,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:50:04,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:50:04,233 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:50:04,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:50:04,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:50:04,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:50:04,234 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-01-11 11:50:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:50:07,318 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-01-11 11:50:07,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:50:07,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 11:50:07,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:50:07,320 INFO L225 Difference]: With dead ends: 332 [2019-01-11 11:50:07,320 INFO L226 Difference]: Without dead ends: 325 [2019-01-11 11:50:07,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:50:07,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-11 11:50:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-01-11 11:50:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-01-11 11:50:09,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-01-11 11:50:09,794 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-01-11 11:50:09,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:50:09,794 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-01-11 11:50:09,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:50:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-01-11 11:50:09,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:50:09,794 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:50:09,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:50:09,795 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:50:09,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:09,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-01-11 11:50:09,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:50:09,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:09,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:50:09,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:09,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:50:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:09,874 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-11 11:50:09,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:09,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:50:09,875 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:50:09,875 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-01-11 11:50:09,875 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:50:09,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:50:10,545 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:50:10,545 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:50:10,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:10,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:50:10,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:10,546 INFO 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-11 11:50:10,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:50:10,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:50:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:10,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:50:10,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 11:50:10,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,598 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-11 11:50:10,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,645 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-11 11:50:10,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,691 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-11 11:50:10,692 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:10,708 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:10,723 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:10,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:10,760 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 18 treesize of output 21 [2019-01-11 11:50:10,764 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 21 treesize of output 23 [2019-01-11 11:50:10,767 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 23 treesize of output 33 [2019-01-11 11:50:10,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:50:10,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:50:10,774 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:10,797 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:10,810 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:10,820 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:10,831 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:10,857 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-11 11:50:10,857 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:50:10,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:50:10,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:10,924 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-11 11:50:10,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:50:10,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,953 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:50:10,954 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-11 11:50:10,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:10,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-11 11:50:10,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-11 11:50:10,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:10,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:11,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:11,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:11,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:11,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:11,004 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:50:11,005 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-11 11:50:11,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:11,027 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-11 11:50:11,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-11 11:50:11,048 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-11 11:50:11,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:50:11,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-11 11:50:11,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:50:11,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:50:11,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:50:11,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:50:11,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:50:11,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:50:11,124 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-01-11 11:50:13,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:50:13,945 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-01-11 11:50:13,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:50:13,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 11:50:13,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:50:13,947 INFO L225 Difference]: With dead ends: 294 [2019-01-11 11:50:13,947 INFO L226 Difference]: Without dead ends: 287 [2019-01-11 11:50:13,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:50:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-11 11:50:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-01-11 11:50:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-11 11:50:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-01-11 11:50:16,559 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-01-11 11:50:16,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:50:16,559 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-01-11 11:50:16,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:50:16,559 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-01-11 11:50:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:50:16,560 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:50:16,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:50:16,560 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:50:16,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:16,560 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-01-11 11:50:16,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:50:16,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:16,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:50:16,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:16,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:50:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:16,700 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-11 11:50:16,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:16,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:50:16,701 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:50:16,701 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-01-11 11:50:16,702 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:50:16,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:50:17,363 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:50:17,363 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:50:17,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:17,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:50:17,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:17,363 INFO 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-11 11:50:17,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:50:17,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:50:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:17,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:50:17,382 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 18 treesize of output 21 [2019-01-11 11:50:17,386 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 21 treesize of output 23 [2019-01-11 11:50:17,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,395 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 23 treesize of output 33 [2019-01-11 11:50:17,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,407 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 25 treesize of output 47 [2019-01-11 11:50:17,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:50:17,423 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:17,454 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:17,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:17,480 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:17,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:17,512 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-11 11:50:17,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,530 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-11 11:50:17,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,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, 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-11 11:50:17,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,611 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-11 11:50:17,611 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:17,626 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:17,641 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:17,656 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:17,684 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-11 11:50:17,685 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:50:17,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,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, 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-11 11:50:17,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:17,744 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-11 11:50:17,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-11 11:50:17,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,790 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-11 11:50:17,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:50:17,888 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-11 11:50:17,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:74 [2019-01-11 11:50:17,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,970 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:50:17,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:17,972 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 41 treesize of output 69 [2019-01-11 11:50:17,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:18,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,037 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:50:18,038 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-11 11:50:18,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:18,091 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-11 11:50:18,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:70 [2019-01-11 11:50:20,175 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 49 [2019-01-11 11:50:20,181 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-11 11:50:20,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:50:20,256 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-11 11:50:20,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:50:20,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-11 11:50:20,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:50:20,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:50:20,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:50:20,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:50:20,277 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-01-11 11:50:20,563 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-01-11 11:50:20,820 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-01-11 11:50:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:50:24,123 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-01-11 11:50:24,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:50:24,124 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 11:50:24,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:50:24,126 INFO L225 Difference]: With dead ends: 364 [2019-01-11 11:50:24,126 INFO L226 Difference]: Without dead ends: 357 [2019-01-11 11:50:24,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:50:24,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-01-11 11:50:26,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-01-11 11:50:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-01-11 11:50:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-01-11 11:50:26,742 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-01-11 11:50:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:50:26,742 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-01-11 11:50:26,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:50:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-01-11 11:50:26,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:50:26,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:50:26,743 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:50:26,743 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:50:26,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:26,744 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-01-11 11:50:26,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:50:26,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:26,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:50:26,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:26,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:50:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:26,847 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-11 11:50:26,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:26,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:50:26,848 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:50:26,848 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-01-11 11:50:26,849 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:50:26,849 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:50:27,488 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:50:27,488 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:50:27,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:27,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:50:27,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:27,489 INFO 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-11 11:50:27,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:50:27,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:50:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:27,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:50:27,508 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 18 treesize of output 21 [2019-01-11 11:50:27,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, 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 23 [2019-01-11 11:50:27,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,521 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 23 treesize of output 33 [2019-01-11 11:50:27,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,530 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 25 treesize of output 47 [2019-01-11 11:50:27,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:50:27,544 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:27,579 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:27,594 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:27,605 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:27,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:27,637 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-11 11:50:27,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,653 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-11 11:50:27,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,691 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-11 11:50:27,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,738 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-11 11:50:27,739 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:27,754 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:27,769 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:27,785 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:27,813 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-11 11:50:27,814 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:50:27,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:50:27,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:27,879 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-11 11:50:27,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:50:27,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 11:50:27,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:27,931 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-11 11:50:27,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-11 11:50:27,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:27,961 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:50:27,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, 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-11 11:50:27,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:27,986 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-11 11:50:27,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 11:50:28,005 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-11 11:50:28,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:50:28,039 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-11 11:50:28,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:50:28,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:50:28,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:50:28,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:50:28,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:50:28,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:50:28,059 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-01-11 11:50:31,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:50:31,390 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-01-11 11:50:31,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:50:31,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 11:50:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:50:31,392 INFO L225 Difference]: With dead ends: 319 [2019-01-11 11:50:31,392 INFO L226 Difference]: Without dead ends: 312 [2019-01-11 11:50:31,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:50:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-01-11 11:50:34,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-01-11 11:50:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-01-11 11:50:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-01-11 11:50:34,529 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-01-11 11:50:34,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:50:34,529 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-01-11 11:50:34,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:50:34,529 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-01-11 11:50:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:50:34,530 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:50:34,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:50:34,530 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:50:34,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:34,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-01-11 11:50:34,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:50:34,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:34,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:50:34,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:34,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:50:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:50:34,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:34,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:50:34,654 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:50:34,655 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-01-11 11:50:34,656 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:50:34,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:50:34,938 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:50:34,939 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:50:34,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:34,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:50:34,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:34,939 INFO 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-11 11:50:34,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:50:34,949 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:50:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:34,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:50:34,958 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-11 11:50:34,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:34,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:34,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-11 11:50:35,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,034 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-11 11:50:35,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,086 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-11 11:50:35,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:35,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:35,122 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:35,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:35,167 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 18 treesize of output 21 [2019-01-11 11:50:35,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:50:35,174 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 23 treesize of output 33 [2019-01-11 11:50:35,178 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 25 treesize of output 47 [2019-01-11 11:50:35,182 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 27 treesize of output 62 [2019-01-11 11:50:35,183 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:35,206 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:35,219 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:35,229 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:35,240 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:35,268 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-11 11:50:35,268 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:50:35,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,307 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-11 11:50:35,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:50:35,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:50:35,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-11 11:50:35,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,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, 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 67 [2019-01-11 11:50:35,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:35,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,568 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-11 11:50:35,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:35,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:50:35,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-01-11 11:50:35,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,675 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:50:35,675 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-11 11:50:35,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:35,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,740 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:50:35,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:35,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 65 [2019-01-11 11:50:35,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:35,785 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-11 11:50:35,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-11 11:50:35,851 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-11 11:50:35,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:50:35,917 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-11 11:50:35,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:50:35,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-11 11:50:35,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:50:35,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:50:35,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:50:35,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:50:35,937 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-01-11 11:50:37,369 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-01-11 11:50:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:50:40,502 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-01-11 11:50:40,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:50:40,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 11:50:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:50:40,504 INFO L225 Difference]: With dead ends: 392 [2019-01-11 11:50:40,504 INFO L226 Difference]: Without dead ends: 386 [2019-01-11 11:50:40,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:50:40,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-11 11:50:43,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-01-11 11:50:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-11 11:50:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-01-11 11:50:43,779 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-01-11 11:50:43,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:50:43,779 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-01-11 11:50:43,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:50:43,779 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-01-11 11:50:43,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:50:43,780 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:50:43,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:50:43,780 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:50:43,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:43,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-01-11 11:50:43,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:50:43,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:43,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:50:43,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:43,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:50:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:50:43,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:50:43,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:50:43,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:50:43,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:50:43,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:50:43,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:50:43,889 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-01-11 11:50:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:50:47,106 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-01-11 11:50:47,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:50:47,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-11 11:50:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:50:47,108 INFO L225 Difference]: With dead ends: 320 [2019-01-11 11:50:47,108 INFO L226 Difference]: Without dead ends: 315 [2019-01-11 11:50:47,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-11 11:50:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-11 11:50:50,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-01-11 11:50:50,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-01-11 11:50:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-01-11 11:50:50,364 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-01-11 11:50:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:50:50,364 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-01-11 11:50:50,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:50:50,364 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-01-11 11:50:50,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:50:50,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:50:50,365 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:50:50,365 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:50:50,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:50,365 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-01-11 11:50:50,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:50:50,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:50,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:50:50,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:50,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:50:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:50,509 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-11 11:50:50,578 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-11 11:50:50,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:50,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:50:50,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:50:50,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:50:50,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:50,579 INFO 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-11 11:50:50,587 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:50:50,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:50:50,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:50:50,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:50:50,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:50:50,596 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-11 11:50:50,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,613 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-11 11:50:50,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,652 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-11 11:50:50,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,701 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-11 11:50:50,701 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:50,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:50,731 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:50,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:50,769 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 18 treesize of output 21 [2019-01-11 11:50:50,772 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 21 treesize of output 23 [2019-01-11 11:50:50,775 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 23 treesize of output 33 [2019-01-11 11:50:50,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:50:50,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:50:50,783 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:50,804 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:50,816 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:50,825 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:50,835 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:50,863 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-11 11:50:50,864 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:50:50,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,893 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-11 11:50:50,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:50,921 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-11 11:50:50,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-11 11:50:50,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:50,951 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-11 11:50:50,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:50,982 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-11 11:50:50,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:46 [2019-01-11 11:50:51,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:51,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:51,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:51,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:51,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:51,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:51,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:51,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 11:50:51,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:50:51,126 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-11 11:50:51,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-01-11 11:50:51,540 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2019-01-11 11:50:51,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:51,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:51,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:51,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:51,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:51,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:51,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:51,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:51,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:51,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:51,553 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:50:51,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-11 11:50:51,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:51,576 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-11 11:50:51,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 11:50:51,601 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-11 11:50:51,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:50:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:50:51,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:50:51,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:50:51,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:50:51,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:50:51,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:50:51,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:50:51,685 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-01-11 11:50:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:50:58,369 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-01-11 11:50:58,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:50:58,369 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 11:50:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:50:58,371 INFO L225 Difference]: With dead ends: 601 [2019-01-11 11:50:58,371 INFO L226 Difference]: Without dead ends: 591 [2019-01-11 11:50:58,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:50:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-01-11 11:51:03,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-01-11 11:51:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-11 11:51:03,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-01-11 11:51:03,877 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-01-11 11:51:03,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:51:03,877 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-01-11 11:51:03,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:51:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-01-11 11:51:03,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:51:03,878 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:51:03,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:51:03,878 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:51:03,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:51:03,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-01-11 11:51:03,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:51:03,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:03,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:51:03,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:03,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:51:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:51:03,997 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-11 11:51:03,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:03,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:51:03,998 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:51:03,998 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-11 11:51:03,999 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:51:03,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:51:04,294 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:51:04,294 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:51:04,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:51:04,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:51:04,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:04,294 INFO 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-11 11:51:04,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:51:04,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:51:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:51:04,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:51:04,314 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-11 11:51:04,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,345 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-11 11:51:04,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,393 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-11 11:51:04,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,441 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-11 11:51:04,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:04,459 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:04,477 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:04,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:04,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:51:04,522 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 21 treesize of output 23 [2019-01-11 11:51:04,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, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:51:04,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:51:04,531 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 27 treesize of output 62 [2019-01-11 11:51:04,531 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:04,553 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:04,566 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:04,576 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:04,587 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:04,612 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-11 11:51:04,613 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:51:04,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,642 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-11 11:51:04,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:04,669 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-11 11:51:04,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:51:04,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,701 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 76 [2019-01-11 11:51:04,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:04,730 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-11 11:51:04,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-11 11:51:04,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,763 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:51:04,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,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, 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 93 [2019-01-11 11:51:04,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:51:04,876 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-11 11:51:04,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-11 11:51:04,914 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-11 11:51:04,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:51:04,950 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-11 11:51:04,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:51:04,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:51:04,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:51:04,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:51:04,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:51:04,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:51:04,969 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-01-11 11:51:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:51:15,486 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-01-11 11:51:15,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:51:15,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 11:51:15,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:51:15,488 INFO L225 Difference]: With dead ends: 731 [2019-01-11 11:51:15,488 INFO L226 Difference]: Without dead ends: 718 [2019-01-11 11:51:15,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:51:15,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-01-11 11:51:24,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-01-11 11:51:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-01-11 11:51:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-01-11 11:51:24,412 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-01-11 11:51:24,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:51:24,413 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-01-11 11:51:24,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:51:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-01-11 11:51:24,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:51:24,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:51:24,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:51:24,414 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:51:24,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:51:24,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-01-11 11:51:24,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:51:24,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:24,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:51:24,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:24,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:51:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:51:24,545 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-11 11:51:24,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:24,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:51:24,545 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:51:24,545 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-01-11 11:51:24,547 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:51:24,547 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:51:24,910 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:51:24,910 INFO L272 AbstractInterpreter]: Visited 9 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:51:24,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:51:24,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:51:24,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:24,911 INFO 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-11 11:51:24,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:51:24,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:51:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:51:24,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:51:24,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 11:51:24,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:24,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:24,956 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-11 11:51:25,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,011 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-11 11:51:25,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,062 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-11 11:51:25,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:25,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:25,097 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:25,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:25,142 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 18 treesize of output 21 [2019-01-11 11:51:25,145 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 21 treesize of output 23 [2019-01-11 11:51:25,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, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:51:25,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:51:25,157 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 27 treesize of output 62 [2019-01-11 11:51:25,157 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:25,199 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:25,212 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:25,221 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:25,231 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:25,260 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-11 11:51:25,260 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:51:25,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,311 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-11 11:51:25,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:25,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:25,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:33 [2019-01-11 11:51:25,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 11:51:25,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:25,382 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-11 11:51:25,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-01-11 11:51:25,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,414 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:51:25,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:51:25,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:25,441 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-11 11:51:25,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-11 11:51:25,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:25,473 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:51:25,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-11 11:51:25,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:25,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:51:25,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-01-11 11:51:25,522 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-11 11:51:25,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:51:25,595 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-11 11:51:25,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:51:25,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:51:25,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:51:25,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:51:25,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:51:25,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:51:25,616 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-01-11 11:51:36,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:51:36,303 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-01-11 11:51:36,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:51:36,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 11:51:36,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:51:36,305 INFO L225 Difference]: With dead ends: 480 [2019-01-11 11:51:36,305 INFO L226 Difference]: Without dead ends: 473 [2019-01-11 11:51:36,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:51:36,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-01-11 11:51:39,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-01-11 11:51:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-11 11:51:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-01-11 11:51:39,835 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-01-11 11:51:39,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:51:39,836 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-01-11 11:51:39,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:51:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-01-11 11:51:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:51:39,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:51:39,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:51:39,837 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:51:39,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:51:39,837 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-01-11 11:51:39,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:51:39,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:39,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:51:39,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:39,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:51:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:51:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:51:39,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:39,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:51:39,951 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:51:39,952 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-11 11:51:39,953 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:51:39,953 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:51:40,225 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:51:40,226 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:51:40,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:51:40,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:51:40,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:40,226 INFO 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-11 11:51:40,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:51:40,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:51:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:51:40,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:51:40,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:51:40,254 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 21 treesize of output 23 [2019-01-11 11:51:40,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,264 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 23 treesize of output 33 [2019-01-11 11:51:40,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:51:40,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,292 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 27 treesize of output 62 [2019-01-11 11:51:40,292 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:40,326 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:40,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:40,355 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:40,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:40,383 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-11 11:51:40,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,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 36 treesize of output 49 [2019-01-11 11:51:40,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:51:40,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,489 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-11 11:51:40,489 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:40,505 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:40,520 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:40,537 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:40,566 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-11 11:51:40,566 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:51:40,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,616 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-11 11:51:40,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:40,634 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-11 11:51:40,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:51:40,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,663 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-11 11:51:40,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:40,699 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-11 11:51:40,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 11:51:40,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,727 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:51:40,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:40,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-11 11:51:40,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:40,755 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-11 11:51:40,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 11:51:40,775 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-11 11:51:40,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:51:40,808 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-11 11:51:40,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:51:40,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:51:40,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:51:40,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:51:40,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:51:40,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:51:40,828 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-01-11 11:51:46,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:51:46,567 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-01-11 11:51:46,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:51:46,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 11:51:46,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:51:46,569 INFO L225 Difference]: With dead ends: 258 [2019-01-11 11:51:46,569 INFO L226 Difference]: Without dead ends: 243 [2019-01-11 11:51:46,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:51:46,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-11 11:51:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-01-11 11:51:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-01-11 11:51:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-01-11 11:51:51,429 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-01-11 11:51:51,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:51:51,429 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-01-11 11:51:51,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:51:51,429 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-01-11 11:51:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:51:51,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:51:51,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:51:51,431 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:51:51,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:51:51,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-01-11 11:51:51,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:51:51,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:51,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:51:51,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:51,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:51:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:51:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:51:51,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:51,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:51:51,616 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:51:51,616 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-01-11 11:51:51,617 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:51:51,617 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:51:52,427 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:51:52,427 INFO L272 AbstractInterpreter]: Visited 9 different actions 19 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:51:52,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:51:52,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:51:52,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:52,427 INFO 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-11 11:51:52,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:51:52,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:51:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:51:52,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:51:52,446 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 18 treesize of output 21 [2019-01-11 11:51:52,451 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 21 treesize of output 23 [2019-01-11 11:51:52,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,462 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 23 treesize of output 33 [2019-01-11 11:51:52,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,476 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 25 treesize of output 47 [2019-01-11 11:51:52,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,495 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 27 treesize of output 62 [2019-01-11 11:51:52,496 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:52,523 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:52,538 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:52,548 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:52,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:52,581 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-11 11:51:52,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,598 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-11 11:51:52,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,634 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-11 11:51:52,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,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, 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-11 11:51:52,683 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:52,698 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:52,713 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:52,730 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:52,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:52,758 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-11 11:51:52,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,798 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-11 11:51:52,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:52,826 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-11 11:51:52,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-11 11:51:52,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:52,862 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:51:52,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, 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 80 [2019-01-11 11:51:52,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:51:52,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:51:52,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-11 11:51:53,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,018 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:51:53,019 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 39 treesize of output 53 [2019-01-11 11:51:53,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:53,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,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, 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 90 [2019-01-11 11:51:53,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:53,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:51:53,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:68 [2019-01-11 11:51:53,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,203 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:51:53,204 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 102 [2019-01-11 11:51:53,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:53,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:53,269 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:51:53,269 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 63 [2019-01-11 11:51:53,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:53,314 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-11 11:51:53,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-01-11 11:51:53,360 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-11 11:51:53,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:51:53,410 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-11 11:51:53,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:51:53,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:51:53,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:51:53,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:51:53,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:51:53,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:51:53,430 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-01-11 11:51:54,335 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-01-11 11:51:59,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:51:59,971 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-01-11 11:51:59,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:51:59,972 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 11:51:59,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:51:59,973 INFO L225 Difference]: With dead ends: 295 [2019-01-11 11:51:59,973 INFO L226 Difference]: Without dead ends: 284 [2019-01-11 11:51:59,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:51:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-11 11:52:04,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-01-11 11:52:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-11 11:52:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-01-11 11:52:04,891 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-01-11 11:52:04,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:52:04,892 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-01-11 11:52:04,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:52:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-01-11 11:52:04,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:52:04,892 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:52:04,892 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:52:04,893 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:52:04,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:52:04,893 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-01-11 11:52:04,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:52:04,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:04,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:52:04,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:04,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:52:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:52:04,983 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-11 11:52:04,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:52:04,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:52:04,984 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:52:04,984 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-01-11 11:52:04,985 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:52:04,985 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:52:05,475 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:52:05,475 INFO L272 AbstractInterpreter]: Visited 8 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:52:05,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:52:05,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:52:05,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:52:05,476 INFO 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-11 11:52:05,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:52:05,486 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:52:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:52:05,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:52:05,500 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 18 treesize of output 21 [2019-01-11 11:52:05,504 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 21 treesize of output 23 [2019-01-11 11:52:05,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,513 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 23 treesize of output 33 [2019-01-11 11:52:05,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,523 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 25 treesize of output 47 [2019-01-11 11:52:05,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:52:05,538 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:05,576 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:05,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:05,600 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:05,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:05,631 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-11 11:52:05,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,648 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-11 11:52:05,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:52:05,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,730 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-11 11:52:05,731 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:05,746 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:05,761 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:05,777 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:05,805 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-11 11:52:05,806 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 11:52:05,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,824 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-11 11:52:05,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:05,851 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-11 11:52:05,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:52:05,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:05,886 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-11 11:52:05,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:52:05,988 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-11 11:52:05,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-11 11:52:06,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:06,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:06,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:06,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:06,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:06,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:06,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:06,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:06,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:06,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 11:52:06,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:06,068 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-11 11:52:06,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:25 [2019-01-11 11:52:06,088 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-11 11:52:06,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:52:06,112 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-11 11:52:06,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:52:06,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:52:06,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:52:06,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:52:06,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:52:06,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:52:06,133 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-01-11 11:52:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:52:13,513 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-01-11 11:52:13,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:52:13,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 11:52:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:52:13,514 INFO L225 Difference]: With dead ends: 328 [2019-01-11 11:52:13,514 INFO L226 Difference]: Without dead ends: 315 [2019-01-11 11:52:13,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:52:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-11 11:52:20,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-01-11 11:52:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-01-11 11:52:20,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-01-11 11:52:20,684 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-01-11 11:52:20,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:52:20,684 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-01-11 11:52:20,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:52:20,684 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-01-11 11:52:20,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:52:20,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:52:20,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:52:20,685 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:52:20,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:52:20,685 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-01-11 11:52:20,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:52:20,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:20,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:52:20,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:20,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:52:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:52:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:52:20,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:52:20,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:52:20,828 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:52:20,828 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-01-11 11:52:20,829 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:52:20,829 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:52:21,108 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:52:21,108 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:52:21,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:52:21,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:52:21,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:52:21,108 INFO 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-11 11:52:21,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:52:21,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:52:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:52:21,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:52:21,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 11:52:21,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,193 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-11 11:52:21,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,235 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-11 11:52:21,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,286 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-11 11:52:21,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:21,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:21,321 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:21,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:21,369 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 18 treesize of output 21 [2019-01-11 11:52:21,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:52:21,374 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 23 treesize of output 37 [2019-01-11 11:52:21,377 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 25 treesize of output 51 [2019-01-11 11:52:21,379 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:52:21,379 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:21,402 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:21,416 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:21,428 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:21,438 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:21,469 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-11 11:52:21,469 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 11:52:21,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,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, 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-11 11:52:21,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:21,534 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-11 11:52:21,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:52:21,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,569 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-11 11:52:21,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:21,603 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-11 11:52:21,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-11 11:52:21,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,640 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:52:21,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:21,642 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-11 11:52:21,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:21,679 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-11 11:52:21,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-11 11:52:21,707 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-11 11:52:21,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:52:21,749 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-11 11:52:21,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:52:21,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:52:21,769 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:52:21,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:52:21,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:52:21,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:52:21,770 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-01-11 11:52:31,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:52:31,710 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-01-11 11:52:31,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:52:31,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 11:52:31,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:52:31,713 INFO L225 Difference]: With dead ends: 326 [2019-01-11 11:52:31,713 INFO L226 Difference]: Without dead ends: 313 [2019-01-11 11:52:31,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:52:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-01-11 11:52:40,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-01-11 11:52:40,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-11 11:52:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-01-11 11:52:40,534 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-01-11 11:52:40,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:52:40,535 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-01-11 11:52:40,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:52:40,535 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-01-11 11:52:40,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:52:40,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:52:40,536 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:52:40,536 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:52:40,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:52:40,536 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-01-11 11:52:40,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:52:40,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:40,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:52:40,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:40,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:52:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:52:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 11:52:40,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:52:40,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:52:40,657 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:52:40,657 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-01-11 11:52:40,658 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:52:40,658 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:52:41,178 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:52:41,179 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:52:41,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:52:41,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:52:41,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:52:41,179 INFO 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-11 11:52:41,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:52:41,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:52:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:52:41,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:52:41,199 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 18 treesize of output 21 [2019-01-11 11:52:41,203 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 21 treesize of output 23 [2019-01-11 11:52:41,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,214 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 23 treesize of output 33 [2019-01-11 11:52:41,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,224 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 25 treesize of output 47 [2019-01-11 11:52:41,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,234 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 27 treesize of output 62 [2019-01-11 11:52:41,234 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:41,261 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:41,275 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:41,286 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:41,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:41,318 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-11 11:52:41,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,335 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-11 11:52:41,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,373 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-11 11:52:41,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,419 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-11 11:52:41,420 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:41,435 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:41,450 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:41,466 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:41,494 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-11 11:52:41,494 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:52:41,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,529 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-11 11:52:41,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:52:41,625 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-11 11:52:41,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-11 11:52:41,877 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 29 [2019-01-11 11:52:41,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,883 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:52:41,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 58 [2019-01-11 11:52:41,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:41,903 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-11 11:52:41,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2019-01-11 11:52:41,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-11 11:52:41,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:41,951 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-11 11:52:41,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-11 11:52:41,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:41,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-11 11:52:41,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:42,007 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-11 11:52:42,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-01-11 11:52:42,030 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-11 11:52:42,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:52:42,073 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-11 11:52:42,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:52:42,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 11:52:42,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:52:42,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:52:42,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:52:42,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:52:42,094 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-01-11 11:52:54,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:52:54,152 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-01-11 11:52:54,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:52:54,153 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-11 11:52:54,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:52:54,154 INFO L225 Difference]: With dead ends: 400 [2019-01-11 11:52:54,154 INFO L226 Difference]: Without dead ends: 393 [2019-01-11 11:52:54,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:52:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-11 11:53:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-01-11 11:53:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-11 11:53:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-01-11 11:53:05,289 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-01-11 11:53:05,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:53:05,290 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-01-11 11:53:05,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:53:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-01-11 11:53:05,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:53:05,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:53:05,291 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:53:05,291 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:53:05,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:53:05,291 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-01-11 11:53:05,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:53:05,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:53:05,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:53:05,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:53:05,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:53:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:53:05,496 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2019-01-11 11:53:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 11:53:05,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:53:05,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:53:05,556 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:53:05,556 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-01-11 11:53:05,557 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:53:05,557 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:53:05,836 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:53:05,836 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:53:05,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:53:05,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:53:05,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:53:05,837 INFO 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-11 11:53:05,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:53:05,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:53:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:53:05,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:53:05,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:53:05,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2019-01-11 11:53:05,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:05,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:05,868 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 23 treesize of output 33 [2019-01-11 11:53:05,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:05,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:05,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:05,894 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 25 treesize of output 47 [2019-01-11 11:53:05,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:05,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:05,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:05,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:05,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:53:05,904 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:05,929 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:05,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:05,953 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:05,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:05,982 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-11 11:53:05,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:05,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:05,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:53:06,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,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, 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-11 11:53:06,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,082 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-11 11:53:06,083 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:06,098 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:06,113 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:06,129 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:06,157 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-11 11:53:06,158 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:53:06,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,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, 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-11 11:53:06,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:53:06,296 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-11 11:53:06,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-11 11:53:06,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,363 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:53:06,364 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 49 treesize of output 62 [2019-01-11 11:53:06,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:06,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,429 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:53:06,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 79 [2019-01-11 11:53:06,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:06,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:53:06,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:74 [2019-01-11 11:53:06,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,526 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 56 treesize of output 82 [2019-01-11 11:53:06,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:06,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,589 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:53:06,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-11 11:53:06,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:06,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:53:06,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-01-11 11:53:06,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,686 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 102 [2019-01-11 11:53:06,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:06,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:06,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 71 [2019-01-11 11:53:06,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:06,796 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-11 11:53:06,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-11 11:53:06,842 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-11 11:53:06,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:53:06,895 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-11 11:53:06,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:53:06,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 11:53:06,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:53:06,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:53:06,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:53:06,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:53:06,916 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-01-11 11:53:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:53:20,094 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-01-11 11:53:20,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:53:20,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-11 11:53:20,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:53:20,097 INFO L225 Difference]: With dead ends: 441 [2019-01-11 11:53:20,097 INFO L226 Difference]: Without dead ends: 428 [2019-01-11 11:53:20,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:53:20,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-01-11 11:53:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-01-11 11:53:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-11 11:53:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-01-11 11:53:31,191 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-01-11 11:53:31,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:53:31,191 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-01-11 11:53:31,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:53:31,191 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-01-11 11:53:31,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:53:31,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:53:31,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:53:31,192 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:53:31,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:53:31,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-01-11 11:53:31,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:53:31,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:53:31,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:53:31,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:53:31,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:53:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:53:31,491 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-01-11 11:53:31,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 11:53:31,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:53:31,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:53:31,576 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:53:31,576 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-01-11 11:53:31,577 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:53:31,577 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:53:31,931 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:53:31,932 INFO L272 AbstractInterpreter]: Visited 9 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:53:31,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:53:31,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:53:31,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:53:31,932 INFO 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-11 11:53:31,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:53:31,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:53:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:53:31,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:53:31,948 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 18 treesize of output 21 [2019-01-11 11:53:31,953 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 21 treesize of output 23 [2019-01-11 11:53:31,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:31,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:31,961 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 23 treesize of output 33 [2019-01-11 11:53:31,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:31,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:31,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:31,972 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 25 treesize of output 47 [2019-01-11 11:53:31,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:31,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:31,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:31,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:31,988 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 27 treesize of output 62 [2019-01-11 11:53:31,988 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:32,013 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:32,028 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:32,038 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:32,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:32,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 43 treesize of output 39 [2019-01-11 11:53:32,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,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 36 treesize of output 49 [2019-01-11 11:53:32,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,124 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-11 11:53:32,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,170 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-11 11:53:32,170 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:32,184 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:32,199 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:32,215 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:32,243 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-11 11:53:32,244 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:53:32,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,284 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-11 11:53:32,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:53:32,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:53:32,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-11 11:53:32,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 67 [2019-01-11 11:53:32,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:32,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,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, 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 96 [2019-01-11 11:53:32,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:32,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:53:32,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-01-11 11:53:32,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,630 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:53:32,631 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 99 [2019-01-11 11:53:32,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:32,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,697 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:53:32,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-01-11 11:53:32,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:32,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:53:32,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-01-11 11:53:32,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,793 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:53:32,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 83 [2019-01-11 11:53:32,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:32,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:32,857 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:53:32,858 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 48 treesize of output 106 [2019-01-11 11:53:32,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:32,910 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-11 11:53:32,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-01-11 11:53:35,647 WARN L181 SmtUtils]: Spent 719.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-11 11:53:35,653 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-11 11:53:35,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:53:35,715 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-11 11:53:35,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:53:35,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:53:35,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:53:35,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:53:35,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:53:35,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=156, Unknown=1, NotChecked=0, Total=240 [2019-01-11 11:53:35,735 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-01-11 11:53:43,856 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-01-11 11:53:57,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:53:57,239 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-01-11 11:53:57,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:53:57,239 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 11:53:57,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:53:57,241 INFO L225 Difference]: With dead ends: 685 [2019-01-11 11:53:57,241 INFO L226 Difference]: Without dead ends: 677 [2019-01-11 11:53:57,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=137, Invalid=242, Unknown=1, NotChecked=0, Total=380 [2019-01-11 11:53:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-01-11 11:54:13,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-01-11 11:54:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-01-11 11:54:13,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-01-11 11:54:13,762 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-01-11 11:54:13,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:54:13,763 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-01-11 11:54:13,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:54:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-01-11 11:54:13,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:54:13,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:54:13,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:54:13,764 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:54:13,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:54:13,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-01-11 11:54:13,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:54:13,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:54:13,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:54:13,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:54:13,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:54:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:54:14,081 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-01-11 11:54:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:54:14,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:54:14,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:54:14,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:54:14,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:54:14,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:54:14,180 INFO 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-11 11:54:14,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:54:14,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:54:14,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:54:14,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:54:14,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:54:14,200 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-11 11:54:14,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,216 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-11 11:54:14,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,254 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-11 11:54:14,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,303 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-11 11:54:14,303 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:14,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:14,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:14,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:14,371 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 18 treesize of output 21 [2019-01-11 11:54:14,374 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 21 treesize of output 23 [2019-01-11 11:54:14,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:54:14,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:54:14,385 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 27 treesize of output 62 [2019-01-11 11:54:14,386 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:14,409 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:14,422 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:14,432 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:14,442 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:14,470 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-11 11:54:14,471 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:54:14,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,511 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-11 11:54:14,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:54:14,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:54:14,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-11 11:54:14,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,702 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-11 11:54:14,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:14,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,770 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:54:14,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-01-11 11:54:14,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:14,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:54:14,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-01-11 11:54:14,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,924 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:54:14,924 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 99 [2019-01-11 11:54:14,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:14,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:14,998 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 55 treesize of output 45 [2019-01-11 11:54:14,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:15,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:54:15,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:70 [2019-01-11 11:54:15,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,102 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 59 [2019-01-11 11:54:15,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:15,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:15,165 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:54:15,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 48 treesize of output 110 [2019-01-11 11:54:15,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:15,220 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-11 11:54:15,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-11 11:54:15,270 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-11 11:54:15,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:54:15,327 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-11 11:54:15,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:54:15,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-11 11:54:15,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:54:15,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:54:15,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:54:15,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:54:15,347 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-01-11 11:54:19,031 WARN L181 SmtUtils]: Spent 3.59 s on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-01-11 11:54:20,411 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-01-11 11:54:35,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:54:35,060 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-01-11 11:54:35,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:54:35,061 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-11 11:54:35,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:54:35,062 INFO L225 Difference]: With dead ends: 550 [2019-01-11 11:54:35,062 INFO L226 Difference]: Without dead ends: 543 [2019-01-11 11:54:35,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:54:35,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-01-11 11:54:38,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-01-11 11:54:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 11:54:38,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-11 11:54:38,305 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-01-11 11:54:38,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:54:38,305 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-11 11:54:38,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:54:38,305 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-11 11:54:38,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:54:38,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:54:38,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:54:38,305 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:54:38,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:54:38,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-01-11 11:54:38,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:54:38,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:54:38,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:54:38,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:54:38,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:54:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:54:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:54:38,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:54:38,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:54:38,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-11 11:54:38,392 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-11 11:54:38,393 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:54:38,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:54:38,753 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:54:38,753 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:54:38,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:54:38,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:54:38,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:54:38,753 INFO 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-11 11:54:38,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:54:38,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:54:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:54:38,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:54:38,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:38,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:54:38,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:38,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:38,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:54:38,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:38,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:38,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:38,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:38,861 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-11 11:54:38,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:38,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:38,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:38,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:38,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:38,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:38,914 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-11 11:54:38,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:38,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:38,946 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:38,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:38,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 18 treesize of output 21 [2019-01-11 11:54:38,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 21 treesize of output 27 [2019-01-11 11:54:38,993 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 23 treesize of output 37 [2019-01-11 11:54:39,010 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 25 treesize of output 51 [2019-01-11 11:54:39,027 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:54:39,028 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:39,398 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:39,596 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:39,747 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:39,883 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:40,269 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-11 11:54:40,269 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 11:54:40,658 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-11 11:54:40,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,693 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-11 11:54:40,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:40,814 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-11 11:54:40,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:54:40,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,853 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-11 11:54:40,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:40,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:54:40,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 11:54:40,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,924 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:54:40,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:40,926 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-11 11:54:40,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:40,964 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-11 11:54:40,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-11 11:54:41,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:41,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:41,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:41,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:41,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:41,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:41,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:41,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:41,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:41,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:41,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:41,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:41,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:41,189 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:54:41,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, 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 96 [2019-01-11 11:54:41,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:41,226 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-11 11:54:41,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:54:41,542 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-11 11:54:41,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:54:41,623 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-11 11:54:41,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:54:41,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-11 11:54:41,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:54:41,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:54:41,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:54:41,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:54:41,644 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-11 11:54:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:54:48,059 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-01-11 11:54:48,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:54:48,060 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-11 11:54:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:54:48,060 INFO L225 Difference]: With dead ends: 67 [2019-01-11 11:54:48,060 INFO L226 Difference]: Without dead ends: 58 [2019-01-11 11:54:48,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:54:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-11 11:54:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-01-11 11:54:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 11:54:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-01-11 11:54:51,644 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-01-11 11:54:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:54:51,644 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-01-11 11:54:51,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:54:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-01-11 11:54:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:54:51,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:54:51,644 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:54:51,644 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:54:51,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:54:51,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-01-11 11:54:51,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:54:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:54:51,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:54:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:54:51,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:54:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:54:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-11 11:54:51,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:54:51,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:54:51,784 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-11 11:54:51,784 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-11 11:54:51,785 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:54:51,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:54:52,134 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:54:52,134 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:54:52,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:54:52,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:54:52,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:54:52,135 INFO 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-11 11:54:52,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:54:52,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:54:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:54:52,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:54:52,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, 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-11 11:54:52,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,179 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-11 11:54:52,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,216 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-11 11:54:52,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,261 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-11 11:54:52,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:52,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:52,289 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:52,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:52,326 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 18 treesize of output 21 [2019-01-11 11:54:52,329 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 21 treesize of output 23 [2019-01-11 11:54:52,332 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 23 treesize of output 33 [2019-01-11 11:54:52,336 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 25 treesize of output 47 [2019-01-11 11:54:52,339 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 27 treesize of output 62 [2019-01-11 11:54:52,339 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:52,362 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:52,374 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:52,384 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:52,393 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:52,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:52,420 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-11 11:54:52,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 11:54:52,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:52,486 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-11 11:54:52,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-11 11:54:52,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,535 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-11 11:54:52,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:54:52,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:54:52,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:68 [2019-01-11 11:54:52,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,692 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:54:52,692 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 83 [2019-01-11 11:54:52,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:52,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,756 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:54:52,756 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 104 [2019-01-11 11:54:52,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:52,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:54:52,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-01-11 11:54:52,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,870 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:54:52,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 109 [2019-01-11 11:54:52,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:52,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:52,938 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:54:52,939 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-11 11:54:52,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:52,981 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-11 11:54:52,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:64 [2019-01-11 11:54:53,033 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-11 11:54:53,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:54:53,097 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-11 11:54:53,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:54:53,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:54:53,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:54:53,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:54:53,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:54:53,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:54:53,117 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-01-11 11:54:59,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:54:59,698 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-01-11 11:54:59,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:54:59,698 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-01-11 11:54:59,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:54:59,699 INFO L225 Difference]: With dead ends: 74 [2019-01-11 11:54:59,699 INFO L226 Difference]: Without dead ends: 59 [2019-01-11 11:54:59,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:54:59,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-11 11:55:03,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-01-11 11:55:03,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 11:55:03,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-11 11:55:03,313 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-01-11 11:55:03,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:55:03,313 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-11 11:55:03,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:55:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-11 11:55:03,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:55:03,314 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:55:03,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:55:03,314 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:55:03,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:55:03,314 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-01-11 11:55:03,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:55:03,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:55:03,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:55:03,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:55:03,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:55:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:55:03,484 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2019-01-11 11:55:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:55:03,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:55:03,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:55:03,583 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-11 11:55:03,583 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-01-11 11:55:03,584 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:55:03,584 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:55:03,942 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:55:03,942 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:55:03,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:55:03,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:55:03,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:55:03,943 INFO 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-11 11:55:03,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:55:03,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:55:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:55:03,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:55:03,959 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-11 11:55:03,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:03,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:03,977 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-11 11:55:04,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:55:04,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,063 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-11 11:55:04,064 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:04,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:04,093 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:04,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:04,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:55:04,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:55:04,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:55:04,142 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 25 treesize of output 47 [2019-01-11 11:55:04,145 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 27 treesize of output 62 [2019-01-11 11:55:04,146 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:04,167 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:04,180 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:04,190 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:04,200 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:04,228 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-11 11:55:04,228 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:55:04,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:55:04,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:04,294 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-11 11:55:04,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:55:04,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,395 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-11 11:55:04,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:04,414 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-11 11:55:04,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-11 11:55:04,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,440 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:55:04,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-11 11:55:04,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:04,465 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-11 11:55:04,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 11:55:04,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:04,498 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:55:04,498 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-11 11:55:04,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:04,520 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-11 11:55:04,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-11 11:55:04,544 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-11 11:55:04,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:55:04,586 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-11 11:55:04,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:55:04,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-11 11:55:04,605 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:55:04,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:55:04,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:55:04,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:55:04,606 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-11 11:55:12,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:55:12,246 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-01-11 11:55:12,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:55:12,246 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-11 11:55:12,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:55:12,247 INFO L225 Difference]: With dead ends: 80 [2019-01-11 11:55:12,247 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 11:55:12,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:55:12,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 11:55:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-01-11 11:55:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-11 11:55:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-01-11 11:55:19,152 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-01-11 11:55:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:55:19,152 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-01-11 11:55:19,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:55:19,152 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-01-11 11:55:19,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-11 11:55:19,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:55:19,152 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:55:19,152 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:55:19,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:55:19,153 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-01-11 11:55:19,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:55:19,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:55:19,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:55:19,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:55:19,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:55:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:55:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-11 11:55:19,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:55:19,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:55:19,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:55:19,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:55:19,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:55:19,261 INFO 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-11 11:55:19,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:55:19,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:55:19,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 11:55:19,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:55:19,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:55:19,284 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 18 treesize of output 21 [2019-01-11 11:55:19,287 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 21 treesize of output 23 [2019-01-11 11:55:19,296 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 23 treesize of output 25 [2019-01-11 11:55:19,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, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-11 11:55:19,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:55:19,320 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:19,337 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:19,348 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:19,358 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:19,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:19,383 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 17 treesize of output 20 [2019-01-11 11:55:19,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-11 11:55:19,391 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 22 treesize of output 24 [2019-01-11 11:55:19,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-11 11:55:19,413 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:19,420 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:19,428 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:19,435 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:19,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-11 11:55:19,453 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-01-11 11:55:19,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:55:19,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:55:19,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-11 11:55:19,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-01-11 11:55:19,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-01-11 11:55:19,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:19,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-01-11 11:55:19,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:19,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-11 11:55:19,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-01-11 11:55:19,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,635 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-01-11 11:55:19,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:19,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-11 11:55:19,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:19,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-11 11:55:19,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-01-11 11:55:19,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-11 11:55:19,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:19,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,749 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-01-11 11:55:19,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:19,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-11 11:55:19,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-01-11 11:55:19,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,802 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:55:19,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2019-01-11 11:55:19,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:19,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:19,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-11 11:55:19,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:19,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:55:19,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:34 [2019-01-11 11:55:19,885 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-11 11:55:19,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:55:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:55:19,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:55:19,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-11 11:55:19,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:55:19,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:55:19,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:55:19,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:55:19,975 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-01-11 11:55:27,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:55:27,224 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-01-11 11:55:27,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:55:27,224 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-01-11 11:55:27,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:55:27,225 INFO L225 Difference]: With dead ends: 71 [2019-01-11 11:55:27,225 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 11:55:27,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:55:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 11:55:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 11:55:27,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 11:55:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 11:55:27,226 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-01-11 11:55:27,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:55:27,226 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 11:55:27,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:55:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 11:55:27,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 11:55:27,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 11:55:27,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:55:28,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:55:37,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:55:37,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:55:37,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:55:37,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:55:37,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:55:37,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:55:38,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:55:39,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:55:39,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:55:39,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:55:39,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:55:44,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:56:01,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:56:02,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:56:12,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:56:51,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:57:09,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:57:23,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent.