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-1ae3202 [2019-03-04 16:53:40,383 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:53:40,385 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:53:40,397 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:53:40,397 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:53:40,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:53:40,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:53:40,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:53:40,403 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:53:40,404 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:53:40,404 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:53:40,405 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:53:40,406 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:53:40,407 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:53:40,408 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:53:40,408 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:53:40,409 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:53:40,411 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:53:40,413 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:53:40,415 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:53:40,416 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:53:40,417 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:53:40,419 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:53:40,420 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:53:40,420 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:53:40,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:53:40,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:53:40,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:53:40,424 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:53:40,425 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:53:40,425 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:53:40,426 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:53:40,426 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:53:40,426 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:53:40,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:53:40,430 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:53:40,430 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-03-04 16:53:40,446 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:53:40,447 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:53:40,447 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:53:40,448 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:53:40,448 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:53:40,448 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:53:40,448 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:53:40,448 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:53:40,449 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:53:40,449 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:53:40,449 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-03-04 16:53:40,449 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:53:40,449 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:53:40,450 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:53:40,450 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:53:40,450 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:53:40,451 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:53:40,451 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:53:40,451 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:53:40,451 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:53:40,451 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:53:40,452 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:53:40,452 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:53:40,452 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:53:40,452 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:53:40,452 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:53:40,453 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:53:40,453 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:53:40,453 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:53:40,453 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:53:40,453 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:53:40,454 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:53:40,454 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:53:40,454 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:53:40,454 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:53:40,454 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:53:40,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:53:40,455 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:53:40,455 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:53:40,485 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:53:40,497 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:53:40,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:53:40,502 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:53:40,503 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:53:40,503 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-03-04 16:53:40,504 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-03-04 16:53:40,535 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:53:40,537 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:53:40,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:40,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:53:40,538 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:53:40,555 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 04.03 04:53:40" (1/1) ... [2019-03-04 16:53:40,573 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 04.03 04:53:40" (1/1) ... [2019-03-04 16:53:40,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:40,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:53:40,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:53:40,608 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:53:40,620 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 04.03 04:53:40" (1/1) ... [2019-03-04 16:53:40,621 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 04.03 04:53:40" (1/1) ... [2019-03-04 16:53:40,623 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 04.03 04:53:40" (1/1) ... [2019-03-04 16:53:40,623 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 04.03 04:53:40" (1/1) ... [2019-03-04 16:53:40,630 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 04.03 04:53:40" (1/1) ... [2019-03-04 16:53:40,641 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 04.03 04:53:40" (1/1) ... [2019-03-04 16:53:40,643 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 04.03 04:53:40" (1/1) ... [2019-03-04 16:53:40,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:53:40,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:53:40,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:53:40,650 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:53:40,654 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 04.03 04:53:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:53:40,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:53:40,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:53:41,025 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:53:41,025 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-03-04 16:53:41,027 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:41 BoogieIcfgContainer [2019-03-04 16:53:41,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:53:41,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:53:41,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:53:41,033 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:53:41,034 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 04.03 04:53:40" (1/2) ... [2019-03-04 16:53:41,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169c9ad5 and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:53:41, skipping insertion in model container [2019-03-04 16:53:41,036 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 04.03 04:53:41" (2/2) ... [2019-03-04 16:53:41,038 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-03-04 16:53:41,064 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:53:41,088 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-03-04 16:53:41,112 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-03-04 16:53:41,164 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:53:41,165 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:53:41,165 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:53:41,165 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:53:41,165 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:53:41,166 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:53:41,166 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:53:41,167 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:53:41,187 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-03-04 16:53:41,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:53:41,205 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:41,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:53:41,213 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:41,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:41,221 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-03-04 16:53:41,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:41,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:41,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:41,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:41,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:41,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:41,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:53:41,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:41,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:41,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:41,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:41,427 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-03-04 16:53:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:41,605 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-03-04 16:53:41,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:41,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:53:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:41,620 INFO L225 Difference]: With dead ends: 25 [2019-03-04 16:53:41,620 INFO L226 Difference]: Without dead ends: 20 [2019-03-04 16:53:41,624 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-03-04 16:53:41,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-03-04 16:53:41,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-03-04 16:53:41,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-03-04 16:53:41,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-03-04 16:53:41,663 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-03-04 16:53:41,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:41,664 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-03-04 16:53:41,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-03-04 16:53:41,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:41,665 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:41,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:41,666 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:41,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:41,667 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-03-04 16:53:41,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:41,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:41,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:41,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:41,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:41,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:41,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:41,856 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:53:41,875 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-03-04 16:53:41,943 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:41,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:42,943 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:42,944 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-03-04 16:53:42,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:42,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:42,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:42,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:53:42,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:42,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:43,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:53:43,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:43,246 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:53:43,247 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,347 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,424 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,504 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,570 INFO L453 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-03-04 16:53:43,591 INFO L453 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 23 [2019-03-04 16:53:43,625 INFO L453 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 25 [2019-03-04 16:53:43,659 INFO L453 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 27 [2019-03-04 16:53:43,919 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:53:43,920 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:44,047 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:44,108 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:44,154 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:44,202 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:44,237 INFO L309 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-03-04 16:53:44,238 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:53:44,415 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-03-04 16:53:44,445 INFO L453 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 31 treesize of output 26 [2019-03-04 16:53:44,446 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:44,484 INFO L309 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-03-04 16:53:44,485 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:35 [2019-03-04 16:53:44,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:44,571 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:44,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:44,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:53:44,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:44,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:53:44,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:53:44,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:53:44,694 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-03-04 16:53:45,009 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-03-04 16:53:45,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:45,238 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-03-04 16:53:45,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:53:45,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:53:45,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:45,240 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:53:45,240 INFO L226 Difference]: Without dead ends: 37 [2019-03-04 16:53:45,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:53:45,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-03-04 16:53:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-03-04 16:53:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:53:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-03-04 16:53:45,246 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-03-04 16:53:45,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:45,246 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-03-04 16:53:45,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:53:45,246 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-03-04 16:53:45,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:45,247 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:45,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:45,248 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:45,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:45,248 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-03-04 16:53:45,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:45,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:45,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:45,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:45,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:45,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:45,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:45,379 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:53:45,379 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-03-04 16:53:45,383 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:45,383 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:48,151 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:48,151 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-03-04 16:53:48,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:48,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:48,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:48,153 INFO 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-03-04 16:53:48,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:48,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:48,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:53:48,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:48,424 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:53:48,426 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,453 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,533 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,550 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,577 INFO L453 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-03-04 16:53:48,582 INFO L453 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 23 [2019-03-04 16:53:48,591 INFO L453 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 25 [2019-03-04 16:53:48,595 INFO L453 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 27 [2019-03-04 16:53:48,639 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:53:48,641 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,650 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,660 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,671 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,683 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,731 INFO L309 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-03-04 16:53:48,731 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:53:50,847 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 59 [2019-03-04 16:53:50,853 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:53:51,039 INFO L309 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-03-04 16:53:51,039 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:231 [2019-03-04 16:53:51,217 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 56 [2019-03-04 16:53:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:51,219 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:51,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:53:51,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:53:51,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:51,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:53:51,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:53:51,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=22, Unknown=1, NotChecked=0, Total=42 [2019-03-04 16:53:51,251 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-03-04 16:53:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:51,299 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-03-04 16:53:51,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:51,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-03-04 16:53:51,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:51,302 INFO L225 Difference]: With dead ends: 18 [2019-03-04 16:53:51,303 INFO L226 Difference]: Without dead ends: 17 [2019-03-04 16:53:51,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=19, Invalid=22, Unknown=1, NotChecked=0, Total=42 [2019-03-04 16:53:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-03-04 16:53:51,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-03-04 16:53:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:53:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-03-04 16:53:51,308 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-03-04 16:53:51,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:51,308 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-03-04 16:53:51,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:53:51,308 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-03-04 16:53:51,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:51,309 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:51,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:51,309 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:51,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:51,310 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-03-04 16:53:51,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:51,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:51,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:51,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:51,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:51,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:51,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:53:51,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:51,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:51,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:51,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:51,353 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-03-04 16:53:51,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:51,399 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-03-04 16:53:51,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:51,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:53:51,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:51,402 INFO L225 Difference]: With dead ends: 21 [2019-03-04 16:53:51,402 INFO L226 Difference]: Without dead ends: 20 [2019-03-04 16:53:51,403 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-03-04 16:53:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-03-04 16:53:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-03-04 16:53:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:53:51,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-03-04 16:53:51,407 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-03-04 16:53:51,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:51,408 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-03-04 16:53:51,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:51,408 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-03-04 16:53:51,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:51,409 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:51,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:51,409 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:51,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:51,410 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-03-04 16:53:51,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:51,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:51,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:51,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:51,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:51,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:51,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:51,476 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:53:51,476 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-03-04 16:53:51,480 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:51,480 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:51,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:51,764 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-03-04 16:53:51,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:51,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:51,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:51,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:53:51,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:51,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:51,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:53:51,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:51,839 INFO L453 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-03-04 16:53:51,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:51,869 INFO L453 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 23 [2019-03-04 16:53:51,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:51,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:51,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:51,888 INFO L453 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-03-04 16:53:51,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:51,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:51,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:51,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:51,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:51,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:51,904 INFO L453 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 27 [2019-03-04 16:53:51,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:51,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:51,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:51,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:51,923 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:51,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:51,995 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:53:51,996 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,009 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,021 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,033 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,043 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,080 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:53:52,081 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,091 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,099 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,133 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,155 INFO L309 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-03-04 16:53:52,156 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:53:52,215 INFO L453 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 31 treesize of output 26 [2019-03-04 16:53:52,216 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,235 INFO L309 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-03-04 16:53:52,235 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:35 [2019-03-04 16:53:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:52,249 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:52,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:52,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:53:52,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:52,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:53:52,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:53:52,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:53:52,290 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-03-04 16:53:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:52,438 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-03-04 16:53:52,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:53:52,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:53:52,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:52,441 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:53:52,441 INFO L226 Difference]: Without dead ends: 38 [2019-03-04 16:53:52,442 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-03-04 16:53:52,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-03-04 16:53:52,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-03-04 16:53:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-03-04 16:53:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-03-04 16:53:52,447 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-03-04 16:53:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:52,447 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-03-04 16:53:52,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:53:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-03-04 16:53:52,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:52,448 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:52,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:53:52,448 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:52,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:52,448 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-03-04 16:53:52,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:52,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:52,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:52,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:52,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:52,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:52,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:52,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:52,522 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:53:52,522 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-03-04 16:53:52,525 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:52,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:52,956 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:52,957 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-03-04 16:53:52,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:52,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:52,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:52,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 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-03-04 16:53:52,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:52,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:52,993 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:53:52,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:53,029 INFO L453 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-03-04 16:53:53,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,087 INFO L453 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 23 [2019-03-04 16:53:53,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,104 INFO L453 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-03-04 16:53:53,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,119 INFO L453 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 27 [2019-03-04 16:53:53,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,162 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:53:53,164 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,174 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,186 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,198 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,211 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,250 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:53:53,251 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,256 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,262 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,274 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,296 INFO L309 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-03-04 16:53:53,297 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:53:53,333 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:53:53,334 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:53:53,374 INFO L309 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-03-04 16:53:53,375 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:76 [2019-03-04 16:53:53,458 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 69 [2019-03-04 16:53:53,462 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-03-04 16:53:53,711 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:53:53,713 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,807 INFO L309 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-03-04 16:53:53,808 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-03-04 16:53:54,026 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2019-03-04 16:53:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:54,028 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:54,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:54,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:54,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:53:54,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:54,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:53:54,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:53:54,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:53:54,083 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-03-04 16:53:54,451 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-03-04 16:54:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:02,760 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-03-04 16:54:02,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:54:02,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:54:02,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:02,762 INFO L225 Difference]: With dead ends: 59 [2019-03-04 16:54:02,763 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:54:02,763 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-03-04 16:54:02,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:54:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-03-04 16:54:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-03-04 16:54:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-03-04 16:54:02,771 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-03-04 16:54:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:02,771 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-03-04 16:54:02,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-03-04 16:54:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:54:02,772 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:02,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:54:02,772 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:02,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:02,772 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-03-04 16:54:02,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:02,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:02,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:02,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:02,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:02,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:02,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:02,854 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:54:02,855 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-03-04 16:54:02,856 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:02,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:03,070 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:03,070 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-03-04 16:54:03,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:03,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:03,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:03,071 INFO 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-03-04 16:54:03,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:03,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:03,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:54:03,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:03,139 INFO L453 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-03-04 16:54:03,168 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:54:03,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:03,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:03,182 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:54:03,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:03,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:03,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:03,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:03,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:03,218 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:54:03,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:03,228 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:03,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:03,231 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:03,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:03,263 INFO L453 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:54:03,264 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,274 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,284 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,294 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,304 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,330 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:54:03,331 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,337 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,347 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,365 INFO L309 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-03-04 16:54:03,366 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-03-04 16:54:03,432 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:03,433 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,448 INFO L309 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-03-04 16:54:03,449 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:31 [2019-03-04 16:54:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:03,468 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:03,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:54:03,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-03-04 16:54:03,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:54:03,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:54:03,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:54:03,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:54:03,502 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-03-04 16:54:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:03,635 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-03-04 16:54:03,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:54:03,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:54:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:03,636 INFO L225 Difference]: With dead ends: 25 [2019-03-04 16:54:03,637 INFO L226 Difference]: Without dead ends: 24 [2019-03-04 16:54:03,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:54:03,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-03-04 16:54:03,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-03-04 16:54:03,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-03-04 16:54:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-03-04 16:54:03,645 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-03-04 16:54:03,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:03,645 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-03-04 16:54:03,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:54:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-03-04 16:54:03,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:54:03,646 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:03,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:54:03,646 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:03,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:03,647 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-03-04 16:54:03,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:03,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:03,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:03,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:03,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:03,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:03,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:03,778 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:54:03,779 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-03-04 16:54:03,780 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:03,780 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:04,104 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:04,104 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-03-04 16:54:04,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:04,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:04,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:04,105 INFO 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-03-04 16:54:04,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:04,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:04,127 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:54:04,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:04,137 INFO L453 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-03-04 16:54:04,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,145 INFO L453 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 23 [2019-03-04 16:54:04,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,161 INFO L453 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-03-04 16:54:04,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,186 INFO L453 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 27 [2019-03-04 16:54:04,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,244 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:54:04,245 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,257 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,269 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,279 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,288 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,322 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:04,322 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,331 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,342 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,354 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,378 INFO L309 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-03-04 16:54:04,378 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:54:04,418 INFO L453 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 31 treesize of output 26 [2019-03-04 16:54:04,418 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,436 INFO L309 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-03-04 16:54:04,436 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:04,507 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:54:04,508 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,531 INFO L309 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-03-04 16:54:04,531 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-03-04 16:54:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:04,549 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:04,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:04,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:04,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:54:04,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:04,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:04,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:04,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:04,614 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-03-04 16:54:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:05,167 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-03-04 16:54:05,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:54:05,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:54:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:05,168 INFO L225 Difference]: With dead ends: 56 [2019-03-04 16:54:05,168 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:54:05,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:54:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:54:05,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-03-04 16:54:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-03-04 16:54:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-03-04 16:54:05,179 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-03-04 16:54:05,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:05,179 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-03-04 16:54:05,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-03-04 16:54:05,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:54:05,183 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:05,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:54:05,183 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:05,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:05,184 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-03-04 16:54:05,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:05,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:05,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:05,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:05,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:05,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:05,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:05,274 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:54:05,274 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-03-04 16:54:05,275 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:05,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:05,587 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:05,587 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-03-04 16:54:05,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:05,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:05,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:05,587 INFO 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-03-04 16:54:05,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:05,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:05,610 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:54:05,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:05,633 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:05,634 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,641 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,653 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,667 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,685 INFO L453 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-03-04 16:54:05,689 INFO L453 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 23 [2019-03-04 16:54:05,693 INFO L453 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 25 [2019-03-04 16:54:05,702 INFO L453 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 27 [2019-03-04 16:54:05,737 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:54:05,738 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,746 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,756 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,766 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,776 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,798 INFO L309 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-03-04 16:54:05,799 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:54:05,837 INFO L453 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 31 treesize of output 26 [2019-03-04 16:54:05,838 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,855 INFO L309 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-03-04 16:54:05,856 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:05,886 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:54:05,887 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,898 INFO L309 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-03-04 16:54:05,898 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:05,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-03-04 16:54:05,914 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:05,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:05,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:05,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:54:05,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:05,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:05,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:05,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:05,968 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-03-04 16:54:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:06,306 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-03-04 16:54:06,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:54:06,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:54:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:06,307 INFO L225 Difference]: With dead ends: 52 [2019-03-04 16:54:06,308 INFO L226 Difference]: Without dead ends: 48 [2019-03-04 16:54:06,308 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-03-04 16:54:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-03-04 16:54:06,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-03-04 16:54:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-03-04 16:54:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-03-04 16:54:06,318 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-03-04 16:54:06,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:06,318 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-03-04 16:54:06,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:06,318 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-03-04 16:54:06,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:54:06,319 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:06,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:54:06,319 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:06,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:06,320 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-03-04 16:54:06,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:06,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:06,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:06,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:06,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:06,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:06,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:06,362 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:54:06,362 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-03-04 16:54:06,365 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:06,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:07,807 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:07,808 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-03-04 16:54:07,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:07,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:07,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:07,809 INFO 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-03-04 16:54:07,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:07,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:07,829 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:54:07,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:07,837 INFO L453 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-03-04 16:54:07,860 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:54:07,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,876 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:54:07,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,910 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:54:07,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,943 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,944 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,948 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:54:07,949 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:07,959 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:07,970 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:07,981 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:07,993 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:08,032 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:08,032 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:08,036 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:08,046 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:08,062 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:08,091 INFO L309 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-03-04 16:54:08,092 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 16:54:08,162 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:54:08,162 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:08,188 INFO L309 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-03-04 16:54:08,188 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-03-04 16:54:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:08,206 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:08,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:08,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:54:08,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:08,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:54:08,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:54:08,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:54:08,240 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-03-04 16:54:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:08,394 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-03-04 16:54:08,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:54:08,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:54:08,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:08,396 INFO L225 Difference]: With dead ends: 42 [2019-03-04 16:54:08,396 INFO L226 Difference]: Without dead ends: 41 [2019-03-04 16:54:08,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:54:08,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-03-04 16:54:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-03-04 16:54:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-03-04 16:54:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-03-04 16:54:08,405 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-03-04 16:54:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:08,406 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-03-04 16:54:08,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:54:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-03-04 16:54:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:54:08,406 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:08,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:54:08,407 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:08,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:08,407 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-03-04 16:54:08,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:08,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:08,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:08,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:08,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:08,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:08,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:08,466 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:54:08,466 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-03-04 16:54:08,467 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:08,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:09,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:09,062 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-03-04 16:54:09,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:09,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:09,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:09,063 INFO 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-03-04 16:54:09,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:09,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:09,078 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:54:09,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:09,097 INFO L453 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-03-04 16:54:09,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,105 INFO L453 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 23 [2019-03-04 16:54:09,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,120 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,123 INFO L453 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-03-04 16:54:09,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,142 INFO L453 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 27 [2019-03-04 16:54:09,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,166 INFO L453 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 26 [2019-03-04 16:54:09,167 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,177 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,189 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,200 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,247 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,303 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:54:09,303 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,309 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,317 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,326 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,368 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,399 INFO L309 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-03-04 16:54:09,400 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-03-04 16:54:09,428 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:54:09,429 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,458 INFO L309 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-03-04 16:54:09,458 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:54:09,494 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:54:09,495 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,519 INFO L309 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-03-04 16:54:09,519 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:40 [2019-03-04 16:54:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:09,538 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:09,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:09,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:54:09,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:09,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:09,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:09,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:09,581 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-03-04 16:54:10,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:10,043 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-03-04 16:54:10,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:54:10,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:54:10,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:10,045 INFO L225 Difference]: With dead ends: 54 [2019-03-04 16:54:10,046 INFO L226 Difference]: Without dead ends: 53 [2019-03-04 16:54:10,046 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-03-04 16:54:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-03-04 16:54:10,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-03-04 16:54:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-03-04 16:54:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-03-04 16:54:10,054 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-03-04 16:54:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:10,055 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-03-04 16:54:10,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-03-04 16:54:10,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:54:10,055 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:10,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:54:10,056 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:10,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:10,056 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-03-04 16:54:10,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:10,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:10,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:10,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:10,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:10,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:10,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:10,169 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:54:10,169 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-03-04 16:54:10,171 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:10,171 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:10,412 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:10,412 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-03-04 16:54:10,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:10,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:10,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:10,412 INFO 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-03-04 16:54:10,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:10,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:10,426 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:54:10,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:10,449 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:10,450 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:10,459 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:10,473 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:10,487 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:10,506 INFO L453 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-03-04 16:54:10,510 INFO L453 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 23 [2019-03-04 16:54:10,514 INFO L453 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 25 [2019-03-04 16:54:10,521 INFO L453 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 27 [2019-03-04 16:54:10,550 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:54:10,551 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:10,570 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:10,580 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:10,590 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:10,600 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:10,621 INFO L309 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-03-04 16:54:10,622 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:54:10,658 INFO L453 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 31 treesize of output 26 [2019-03-04 16:54:10,658 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:10,678 INFO L309 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-03-04 16:54:10,678 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:54:10,707 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2019-03-04 16:54:10,708 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:10,727 INFO L309 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-03-04 16:54:10,728 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-03-04 16:54:10,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-03-04 16:54:10,761 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:10,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:10,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:54:10,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:10,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:10,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:10,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:54:10,815 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-03-04 16:54:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:11,111 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-03-04 16:54:11,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:54:11,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:54:11,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:11,113 INFO L225 Difference]: With dead ends: 63 [2019-03-04 16:54:11,114 INFO L226 Difference]: Without dead ends: 61 [2019-03-04 16:54:11,114 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-03-04 16:54:11,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-03-04 16:54:11,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-03-04 16:54:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-03-04 16:54:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-03-04 16:54:11,132 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-03-04 16:54:11,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:11,132 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-03-04 16:54:11,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-03-04 16:54:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:54:11,133 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:11,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:54:11,133 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:11,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:11,134 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-03-04 16:54:11,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:11,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:11,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:11,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:11,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:11,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:54:11,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:54:11,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:54:11,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:54:11,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:54:11,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:54:11,218 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-03-04 16:54:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:11,264 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-03-04 16:54:11,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:54:11,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:54:11,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:11,266 INFO L225 Difference]: With dead ends: 41 [2019-03-04 16:54:11,266 INFO L226 Difference]: Without dead ends: 40 [2019-03-04 16:54:11,266 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-03-04 16:54:11,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-03-04 16:54:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-03-04 16:54:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-03-04 16:54:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-03-04 16:54:11,276 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-03-04 16:54:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:11,277 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-03-04 16:54:11,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:54:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-03-04 16:54:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:54:11,278 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:11,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:54:11,278 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:11,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:11,278 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-03-04 16:54:11,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:11,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:11,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:11,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:11,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:11,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:11,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:11,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:11,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:11,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:11,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:54:11,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:11,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:11,371 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:54:11,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:11,372 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:54:11,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:11,378 INFO L453 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-03-04 16:54:11,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,390 INFO L453 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 23 [2019-03-04 16:54:11,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,399 INFO L453 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-03-04 16:54:11,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,444 INFO L453 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 27 [2019-03-04 16:54:11,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:11,465 INFO L453 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 26 [2019-03-04 16:54:11,465 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,475 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,487 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,498 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,510 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,568 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:54:11,568 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,574 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,585 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,598 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,616 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,647 INFO L309 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-03-04 16:54:11,648 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-03-04 16:54:11,691 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:54:11,692 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,751 INFO L309 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-03-04 16:54:11,751 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:54:11,795 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:54:11,796 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,820 INFO L309 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-03-04 16:54:11,821 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:46 [2019-03-04 16:54:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:11,838 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:11,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-03-04 16:54:11,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:11,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:54:11,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:11,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:11,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:11,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:11,894 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-03-04 16:54:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:12,386 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-03-04 16:54:12,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:54:12,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:54:12,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:12,388 INFO L225 Difference]: With dead ends: 57 [2019-03-04 16:54:12,388 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:54:12,389 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-03-04 16:54:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:54:12,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-03-04 16:54:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-03-04 16:54:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-03-04 16:54:12,400 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-03-04 16:54:12,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:12,400 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-03-04 16:54:12,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-03-04 16:54:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:54:12,401 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:12,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:54:12,401 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:12,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:12,401 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-03-04 16:54:12,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:12,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:12,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:12,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:12,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:12,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:12,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:12,532 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:54:12,532 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-03-04 16:54:12,534 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:12,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:12,752 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:12,752 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-03-04 16:54:12,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:12,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:12,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:12,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 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-03-04 16:54:12,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:12,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:12,767 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:54:12,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:12,794 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:12,795 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:12,809 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:12,819 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:12,836 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:12,854 INFO L453 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-03-04 16:54:12,858 INFO L453 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 23 [2019-03-04 16:54:12,862 INFO L453 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 25 [2019-03-04 16:54:12,866 INFO L453 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 27 [2019-03-04 16:54:12,895 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:54:12,896 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:12,905 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:12,915 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:12,948 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:12,961 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:12,983 INFO L309 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-03-04 16:54:12,984 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:54:13,012 INFO L453 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 31 treesize of output 26 [2019-03-04 16:54:13,012 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,029 INFO L309 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-03-04 16:54:13,030 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:13,064 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:54:13,065 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,078 INFO L309 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-03-04 16:54:13,078 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:13,091 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:13,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:13,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:54:13,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:13,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:13,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:13,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:54:13,132 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-03-04 16:54:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:13,449 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-03-04 16:54:13,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:54:13,450 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:54:13,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:13,451 INFO L225 Difference]: With dead ends: 61 [2019-03-04 16:54:13,451 INFO L226 Difference]: Without dead ends: 60 [2019-03-04 16:54:13,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:13,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-03-04 16:54:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-03-04 16:54:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-03-04 16:54:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-03-04 16:54:13,463 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-03-04 16:54:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:13,463 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-03-04 16:54:13,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-03-04 16:54:13,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:54:13,464 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:13,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:54:13,464 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:13,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:13,465 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-03-04 16:54:13,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:13,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:13,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:13,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:13,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:13,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:13,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:13,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:13,493 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:54:13,493 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-03-04 16:54:13,496 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:13,496 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:13,643 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:13,643 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-03-04 16:54:13,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:13,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:13,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:13,644 INFO 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-03-04 16:54:13,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:13,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:13,660 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:54:13,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:13,695 INFO L453 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-03-04 16:54:13,725 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:54:13,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:13,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:13,762 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:54:13,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:13,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:13,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:13,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:13,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:13,791 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:54:13,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:13,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:13,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:13,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:13,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:13,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:13,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:13,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:13,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:13,823 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:54:13,823 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,835 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,845 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,855 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,865 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,933 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:13,933 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,940 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,954 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,970 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,001 INFO L309 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-03-04 16:54:14,002 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 16:54:14,024 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:54:14,024 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,051 INFO L309 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-03-04 16:54:14,052 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-03-04 16:54:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:14,067 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54: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-03-04 16:54:14,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:14,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:54:14,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:14,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:54:14,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:54:14,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:54:14,145 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-03-04 16:54:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:14,706 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-03-04 16:54:14,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:54:14,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:54:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:14,707 INFO L225 Difference]: With dead ends: 53 [2019-03-04 16:54:14,707 INFO L226 Difference]: Without dead ends: 52 [2019-03-04 16:54:14,707 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-03-04 16:54:14,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-03-04 16:54:14,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-03-04 16:54:14,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-03-04 16:54:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-03-04 16:54:14,718 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-03-04 16:54:14,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:14,719 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-03-04 16:54:14,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:54:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-03-04 16:54:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:54:14,720 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:14,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:54:14,721 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:14,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:14,721 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-03-04 16:54:14,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:14,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:14,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:14,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:14,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:14,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:14,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:14,794 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:54:14,795 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-03-04 16:54:14,795 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:14,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:14,990 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:14,990 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-03-04 16:54:14,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:14,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:14,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:14,991 INFO 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-03-04 16:54:15,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:15,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:15,008 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:54:15,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:15,018 INFO L453 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-03-04 16:54:15,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,027 INFO L453 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 23 [2019-03-04 16:54:15,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,038 INFO L453 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-03-04 16:54:15,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,052 INFO L453 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 27 [2019-03-04 16:54:15,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,078 INFO L453 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 26 [2019-03-04 16:54:15,079 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:15,092 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:15,107 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:15,121 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:15,131 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:15,174 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:54:15,175 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:15,177 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:15,182 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:15,194 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:15,214 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:15,246 INFO L309 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-03-04 16:54:15,246 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-03-04 16:54:15,288 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:54:15,289 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:15,320 INFO L309 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-03-04 16:54:15,320 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:54:15,358 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:54:15,359 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:15,687 INFO L309 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-03-04 16:54:15,688 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:40 [2019-03-04 16:54:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:15,817 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:15,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:15,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:54:15,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:15,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:15,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:15,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:15,859 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-03-04 16:54:16,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:16,215 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-03-04 16:54:16,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:54:16,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:54:16,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:16,217 INFO L225 Difference]: With dead ends: 69 [2019-03-04 16:54:16,217 INFO L226 Difference]: Without dead ends: 68 [2019-03-04 16:54:16,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:54:16,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-03-04 16:54:16,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-03-04 16:54:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-03-04 16:54:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-03-04 16:54:16,228 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-03-04 16:54:16,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:16,228 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-03-04 16:54:16,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:16,228 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-03-04 16:54:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:16,229 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:16,229 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-03-04 16:54:16,229 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:16,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:16,230 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-03-04 16:54:16,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:16,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:16,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:16,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:16,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:16,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:16,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:16,342 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:16,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:16,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:16,343 INFO 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-03-04 16:54:16,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:16,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:16,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:54:16,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:16,359 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:54:16,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:16,365 INFO L453 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-03-04 16:54:16,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,369 INFO L453 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 23 [2019-03-04 16:54:16,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,392 INFO L453 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-03-04 16:54:16,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,410 INFO L453 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 27 [2019-03-04 16:54:16,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:16,427 INFO L453 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 26 [2019-03-04 16:54:16,427 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,439 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,450 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,462 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,473 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,585 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:54:16,585 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,592 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,601 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,614 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,633 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,664 INFO L309 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-03-04 16:54:16,665 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-03-04 16:54:16,688 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:54:16,688 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,728 INFO L309 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-03-04 16:54:16,729 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:54:16,784 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 38 treesize of output 49 [2019-03-04 16:54:16,785 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,809 INFO L309 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-03-04 16:54:16,809 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:52 [2019-03-04 16:54:16,841 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:54:16,841 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,861 INFO L309 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-03-04 16:54:16,861 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-03-04 16:54:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:16,878 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:16,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:16,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-03-04 16:54:16,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:16,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:54:16,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:54:16,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:54:16,921 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-03-04 16:54:17,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:17,269 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-03-04 16:54:17,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:54:17,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-03-04 16:54:17,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:17,271 INFO L225 Difference]: With dead ends: 73 [2019-03-04 16:54:17,271 INFO L226 Difference]: Without dead ends: 71 [2019-03-04 16:54:17,272 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-03-04 16:54:17,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-03-04 16:54:17,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-03-04 16:54:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-03-04 16:54:17,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-03-04 16:54:17,282 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-03-04 16:54:17,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:17,283 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-03-04 16:54:17,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:54:17,283 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-03-04 16:54:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:17,283 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:17,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:17,284 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:17,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:17,284 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-03-04 16:54:17,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:17,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:17,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:17,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:17,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:17,540 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-03-04 16:54:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:17,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:17,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:17,597 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:54:17,597 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-03-04 16:54:17,599 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:17,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:17,892 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:17,893 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-03-04 16:54:17,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:17,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:17,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:17,893 INFO 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-03-04 16:54:17,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:17,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:17,932 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:54:17,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:17,946 INFO L453 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-03-04 16:54:17,968 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:54:17,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:17,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:17,983 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:54:17,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:17,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:17,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:17,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:17,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:17,994 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:54:17,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:18,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:18,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:18,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:18,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:18,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:18,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:18,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:18,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:18,023 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:54:18,023 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:18,034 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:18,044 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:18,053 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:18,064 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:18,213 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:18,213 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:18,307 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:18,457 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:18,687 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:19,066 INFO L309 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-03-04 16:54:19,066 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:54:19,305 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-03-04 16:54:19,374 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:54:19,374 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:19,736 INFO L309 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-03-04 16:54:19,736 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:48 [2019-03-04 16:54:19,872 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:54:19,872 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:19,899 INFO L309 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-03-04 16:54:19,899 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-03-04 16:54:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:19,918 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:19,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:19,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:54:19,961 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:19,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:19,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:19,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:54:19,962 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-03-04 16:54:20,373 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-03-04 16:54:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:20,612 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-03-04 16:54:20,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:54:20,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:54:20,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:20,614 INFO L225 Difference]: With dead ends: 84 [2019-03-04 16:54:20,614 INFO L226 Difference]: Without dead ends: 78 [2019-03-04 16:54:20,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:54:20,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-03-04 16:54:20,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-03-04 16:54:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-03-04 16:54:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-03-04 16:54:20,631 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-03-04 16:54:20,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:20,631 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-03-04 16:54:20,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:20,631 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-03-04 16:54:20,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:20,632 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:20,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:20,632 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:20,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:20,633 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-03-04 16:54:20,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:20,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:20,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:20,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:20,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:20,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:20,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:20,724 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:54:20,724 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-03-04 16:54:20,725 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:20,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:21,063 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:21,063 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-03-04 16:54:21,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:21,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:21,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:21,064 INFO 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-03-04 16:54:21,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:21,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:21,078 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:54:21,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:21,093 INFO L453 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-03-04 16:54:21,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,101 INFO L453 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 23 [2019-03-04 16:54:21,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,112 INFO L453 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-03-04 16:54:21,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,128 INFO L453 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 27 [2019-03-04 16:54:21,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,136 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,207 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:54:21,207 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,216 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,227 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,238 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,249 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,281 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:21,281 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,283 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,290 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,300 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,322 INFO L309 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-03-04 16:54:21,323 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-03-04 16:54:21,361 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:54:21,362 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:54:21,432 INFO L309 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-03-04 16:54:21,433 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:76 [2019-03-04 16:54:21,515 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 69 [2019-03-04 16:54:21,518 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-03-04 16:54:21,680 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:54:21,681 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,775 INFO L309 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-03-04 16:54:21,775 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-03-04 16:54:22,033 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-03-04 16:54:22,059 INFO L453 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 55 treesize of output 50 [2019-03-04 16:54:22,059 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:22,158 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 46 [2019-03-04 16:54:22,159 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:22,364 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:54:22,364 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:22,461 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 49 [2019-03-04 16:54:22,462 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:22,515 INFO L309 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-03-04 16:54:22,516 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:129 [2019-03-04 16:54:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:22,602 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:22,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:22,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:54:22,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:22,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:22,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:22,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:54:22,680 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-03-04 16:54:23,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:23,508 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-03-04 16:54:23,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:54:23,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:54:23,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:23,510 INFO L225 Difference]: With dead ends: 109 [2019-03-04 16:54:23,510 INFO L226 Difference]: Without dead ends: 107 [2019-03-04 16:54:23,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:54:23,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-03-04 16:54:23,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-03-04 16:54:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-03-04 16:54:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-03-04 16:54:23,525 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-03-04 16:54:23,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:23,525 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-03-04 16:54:23,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:23,525 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-03-04 16:54:23,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:23,526 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:23,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:23,526 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:23,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:23,527 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-03-04 16:54:23,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:23,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:23,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:23,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:23,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:23,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:23,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:23,591 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:54:23,592 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-03-04 16:54:23,593 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:23,593 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:23,803 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:23,803 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-03-04 16:54:23,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:23,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:23,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:23,803 INFO 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-03-04 16:54:23,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:23,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:23,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:54:23,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:23,825 INFO L453 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-03-04 16:54:23,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,831 INFO L453 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 23 [2019-03-04 16:54:23,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,842 INFO L453 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-03-04 16:54:23,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,866 INFO L453 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 27 [2019-03-04 16:54:23,873 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,915 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:54:23,915 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,928 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,939 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,949 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,957 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,992 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:23,992 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,994 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,999 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,010 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,031 INFO L309 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-03-04 16:54:24,032 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:54:24,070 INFO L453 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 31 treesize of output 26 [2019-03-04 16:54:24,071 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,088 INFO L309 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-03-04 16:54:24,088 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:24,117 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:54:24,118 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,129 INFO L309 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-03-04 16:54:24,129 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:24,147 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:24,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:24,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:54:24,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:24,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:24,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:24,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:24,190 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-03-04 16:54:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:24,566 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-03-04 16:54:24,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:54:24,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:54:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:24,568 INFO L225 Difference]: With dead ends: 77 [2019-03-04 16:54:24,568 INFO L226 Difference]: Without dead ends: 76 [2019-03-04 16:54:24,568 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-03-04 16:54:24,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-03-04 16:54:24,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-03-04 16:54:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-03-04 16:54:24,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-03-04 16:54:24,587 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-03-04 16:54:24,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:24,587 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-03-04 16:54:24,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-03-04 16:54:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:24,590 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:24,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:24,591 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:24,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:24,591 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-03-04 16:54:24,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:24,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:24,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:24,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:24,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:24,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:24,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:24,746 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:24,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:24,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:24,746 INFO 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-03-04 16:54:24,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:24,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:24,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:54:24,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:24,761 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:54:24,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:24,809 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:54:24,810 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,818 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,830 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,844 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,861 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,887 INFO L453 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-03-04 16:54:24,890 INFO L453 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 23 [2019-03-04 16:54:24,892 INFO L453 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 25 [2019-03-04 16:54:24,896 INFO L453 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 27 [2019-03-04 16:54:24,900 INFO L453 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 26 [2019-03-04 16:54:24,900 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,908 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,918 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,929 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,948 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,987 INFO L309 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-03-04 16:54:24,988 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:54:25,026 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:54:25,027 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:25,064 INFO L309 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-03-04 16:54:25,064 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:54:25,126 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:54:25,127 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:25,155 INFO L309 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-03-04 16:54:25,156 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:46 [2019-03-04 16:54:25,239 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 45 [2019-03-04 16:54:25,239 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:25,283 INFO L309 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-03-04 16:54:25,283 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-03-04 16:54:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:25,304 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:25,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:25,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:54:25,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:25,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:25,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:25,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:54:25,371 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-03-04 16:54:25,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:25,851 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-03-04 16:54:25,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:54:25,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:54:25,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:25,854 INFO L225 Difference]: With dead ends: 88 [2019-03-04 16:54:25,854 INFO L226 Difference]: Without dead ends: 83 [2019-03-04 16:54:25,856 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-03-04 16:54:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-03-04 16:54:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-03-04 16:54:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:54:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-03-04 16:54:25,870 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-03-04 16:54:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:25,870 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-03-04 16:54:25,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:25,870 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-03-04 16:54:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:25,871 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:25,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:25,871 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:25,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:25,871 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-03-04 16:54:25,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:25,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:25,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:25,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:25,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:26,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:26,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:26,038 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:54:26,038 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-03-04 16:54:26,040 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:26,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:26,289 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:26,289 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-03-04 16:54:26,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:26,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:26,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:26,290 INFO 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-03-04 16:54:26,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:26,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:26,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:54:26,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:26,353 INFO L453 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-03-04 16:54:26,493 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:54:26,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:26,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:26,610 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:54:26,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:26,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:26,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:26,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:26,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:26,765 INFO L301 Elim1Store]: Index analysis took 131 ms [2019-03-04 16:54:26,782 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:54:26,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:26,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:26,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:26,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:26,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:26,860 INFO L453 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:54:26,861 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:26,872 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:26,883 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:26,893 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:26,904 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:26,933 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:54:26,933 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:26,937 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:26,946 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:26,965 INFO L309 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-03-04 16:54:26,965 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-03-04 16:54:26,995 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:54:26,995 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:27,004 INFO L309 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-03-04 16:54:27,004 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-03-04 16:54:27,029 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:54:27,030 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:27,039 INFO L309 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-03-04 16:54:27,039 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-03-04 16:54:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:27,051 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:27,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:27,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:54:27,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:27,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:27,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:27,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:27,145 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-03-04 16:54:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:27,405 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-03-04 16:54:27,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:54:27,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:54:27,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:27,407 INFO L225 Difference]: With dead ends: 81 [2019-03-04 16:54:27,407 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:54:27,408 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-03-04 16:54:27,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:54:27,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-03-04 16:54:27,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:54:27,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-03-04 16:54:27,426 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-03-04 16:54:27,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:27,426 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-03-04 16:54:27,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:27,426 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-03-04 16:54:27,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:27,427 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:27,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:27,427 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:27,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:27,428 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-03-04 16:54:27,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:27,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:27,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:27,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:27,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:27,689 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-03-04 16:54:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:27,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:27,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:27,759 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:54:27,759 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-03-04 16:54:27,761 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:27,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:28,107 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:28,107 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-03-04 16:54:28,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:28,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:28,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:28,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 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-03-04 16:54:28,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:28,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:28,120 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:54:28,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:28,156 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:28,156 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:28,165 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:28,180 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:28,193 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:28,208 INFO L453 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-03-04 16:54:28,212 INFO L453 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 23 [2019-03-04 16:54:28,217 INFO L453 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 25 [2019-03-04 16:54:28,233 INFO L453 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 27 [2019-03-04 16:54:28,264 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:54:28,265 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:28,273 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:28,283 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:28,293 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:28,302 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:28,324 INFO L309 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-03-04 16:54:28,324 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-03-04 16:54:28,370 INFO L453 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 31 treesize of output 26 [2019-03-04 16:54:28,370 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:28,388 INFO L309 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-03-04 16:54:28,388 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:28,421 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:54:28,422 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:28,433 INFO L309 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-03-04 16:54:28,433 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:28,478 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:54:28,479 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:28,491 INFO L309 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-03-04 16:54:28,491 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:54:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:28,508 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:28,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:28,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:54:28,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:28,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:28,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:28,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:54:28,582 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-03-04 16:54:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:29,068 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-03-04 16:54:29,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:54:29,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:54:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:29,071 INFO L225 Difference]: With dead ends: 113 [2019-03-04 16:54:29,071 INFO L226 Difference]: Without dead ends: 112 [2019-03-04 16:54:29,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:54:29,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-03-04 16:54:29,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-03-04 16:54:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-03-04 16:54:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-03-04 16:54:29,091 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-03-04 16:54:29,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:29,091 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-03-04 16:54:29,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:29,091 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-03-04 16:54:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:29,092 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:29,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:29,092 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:29,092 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-03-04 16:54:29,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:29,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:29,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:29,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:29,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:29,577 WARN L181 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-03-04 16:54:29,727 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-03-04 16:54:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:29,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:29,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:29,743 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:54:29,743 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-03-04 16:54:29,745 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:29,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:30,028 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:30,028 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-03-04 16:54:30,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:30,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:30,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:30,029 INFO 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-03-04 16:54:30,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:30,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:30,041 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:54:30,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:30,054 INFO L453 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-03-04 16:54:30,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:30,058 INFO L453 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 23 [2019-03-04 16:54:30,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:30,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:30,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:30,108 INFO L453 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-03-04 16:54:30,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:30,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:30,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:30,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:30,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:30,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:30,118 INFO L453 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 27 [2019-03-04 16:54:30,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:30,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:30,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:30,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:30,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:30,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:30,233 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:54:30,234 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:30,244 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:30,255 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:30,266 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:30,278 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:30,323 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:30,324 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:30,329 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:30,338 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:30,352 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:30,383 INFO L309 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-03-04 16:54:30,383 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:54:30,479 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 59 [2019-03-04 16:54:30,484 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:54:30,586 INFO L309 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-03-04 16:54:30,586 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:231 [2019-03-04 16:54:30,680 INFO L453 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 55 treesize of output 50 [2019-03-04 16:54:30,681 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:30,787 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 43 treesize of output 59 [2019-03-04 16:54:30,788 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:30,862 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:54:30,862 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:30,909 INFO L309 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-03-04 16:54:30,909 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:158, output treesize:100 [2019-03-04 16:54:31,403 WARN L181 SmtUtils]: Spent 475.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-03-04 16:54:31,462 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 49 [2019-03-04 16:54:31,463 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:31,547 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:54:31,548 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:31,607 INFO L453 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 55 treesize of output 50 [2019-03-04 16:54:31,607 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:31,650 INFO L309 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-03-04 16:54:31,651 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-03-04 16:54:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:31,697 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:31,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:31,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-03-04 16:54:31,731 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:31,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:31,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:31,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:54:31,732 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-03-04 16:54:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:32,586 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-03-04 16:54:32,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:54:32,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:54:32,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:32,589 INFO L225 Difference]: With dead ends: 137 [2019-03-04 16:54:32,589 INFO L226 Difference]: Without dead ends: 136 [2019-03-04 16:54:32,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:54:32,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-03-04 16:54:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-03-04 16:54:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-03-04 16:54:32,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-03-04 16:54:32,634 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-03-04 16:54:32,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:32,634 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-03-04 16:54:32,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:32,634 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-03-04 16:54:32,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:32,635 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:32,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:32,635 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:32,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:32,635 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-03-04 16:54:32,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:32,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:32,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:32,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:32,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:32,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:32,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:32,748 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:54:32,748 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-03-04 16:54:32,750 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:32,750 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:33,294 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:33,295 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-03-04 16:54:33,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:33,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:33,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:33,296 INFO 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-03-04 16:54:33,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:33,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:33,334 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:54:33,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:33,497 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:54:33,498 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:33,506 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:33,513 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:33,525 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:33,543 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:33,569 INFO L453 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-03-04 16:54:33,572 INFO L453 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 23 [2019-03-04 16:54:33,575 INFO L453 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 25 [2019-03-04 16:54:33,578 INFO L453 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 27 [2019-03-04 16:54:33,581 INFO L453 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 26 [2019-03-04 16:54:33,582 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:33,592 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:33,602 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:33,612 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:33,622 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:33,653 INFO L309 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-03-04 16:54:33,653 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-03-04 16:54:33,674 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:54:33,674 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:33,701 INFO L309 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-03-04 16:54:33,702 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:54:33,734 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:54:33,735 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:33,758 INFO L309 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-03-04 16:54:33,758 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-03-04 16:54:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:33,776 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:33,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-03-04 16:54:33,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:33,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:54:33,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:33,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:33,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:33,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:33,819 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-03-04 16:54:34,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:34,215 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-03-04 16:54:34,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:54:34,215 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:54:34,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:34,217 INFO L225 Difference]: With dead ends: 120 [2019-03-04 16:54:34,217 INFO L226 Difference]: Without dead ends: 119 [2019-03-04 16:54:34,218 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-03-04 16:54:34,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-03-04 16:54:34,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-03-04 16:54:34,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-03-04 16:54:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-03-04 16:54:34,256 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-03-04 16:54:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:34,256 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-03-04 16:54:34,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:34,257 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-03-04 16:54:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:34,257 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:34,257 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:34,258 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:34,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:34,258 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-03-04 16:54:34,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:34,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:34,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:34,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:34,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:34,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:34,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:34,315 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:54:34,316 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-03-04 16:54:34,316 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:34,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:35,607 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:35,607 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-03-04 16:54:35,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:35,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:35,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:35,607 INFO 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-03-04 16:54:35,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:35,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:35,620 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:54:35,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:35,632 INFO L453 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-03-04 16:54:35,651 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:54:35,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:35,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:35,767 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:54:35,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:35,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:35,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:35,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:35,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:35,937 INFO L301 Elim1Store]: Index analysis took 136 ms [2019-03-04 16:54:35,951 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:54:36,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:36,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:36,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:36,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:36,120 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:36,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:36,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:36,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:36,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:36,217 INFO L301 Elim1Store]: Index analysis took 238 ms [2019-03-04 16:54:36,231 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:54:36,231 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:36,378 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:36,444 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:36,456 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:36,466 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:36,504 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:36,505 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:36,511 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:36,520 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:36,536 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:36,564 INFO L309 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-03-04 16:54:36,565 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 16:54:36,585 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:54:36,586 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:36,613 INFO L309 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-03-04 16:54:36,613 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-03-04 16:54:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:36,631 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:36,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:36,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:54:36,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:54:36,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:54:36,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:54:36,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:54:36,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:54:36,654 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-03-04 16:54:36,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:36,785 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-03-04 16:54:36,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:54:36,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-03-04 16:54:36,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:36,786 INFO L225 Difference]: With dead ends: 105 [2019-03-04 16:54:36,787 INFO L226 Difference]: Without dead ends: 104 [2019-03-04 16:54:36,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:54:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-03-04 16:54:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-03-04 16:54:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-03-04 16:54:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-03-04 16:54:36,863 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-03-04 16:54:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:36,863 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-03-04 16:54:36,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:54:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-03-04 16:54:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:36,864 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:36,864 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:36,864 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:36,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:36,865 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-03-04 16:54:36,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:36,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:36,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:36,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:36,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:37,418 WARN L181 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-03-04 16:54:37,723 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-03-04 16:54:37,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:37,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:37,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:37,744 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:37,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:37,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:37,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 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-03-04 16:54:37,754 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:37,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:37,759 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:37,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:37,760 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:54:37,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:37,768 INFO L453 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-03-04 16:54:37,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:37,771 INFO L453 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 23 [2019-03-04 16:54:37,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:37,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:37,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:37,782 INFO L453 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-03-04 16:54:37,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:37,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:37,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:37,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:37,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:37,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:37,793 INFO L453 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 27 [2019-03-04 16:54:37,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:37,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:37,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:37,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:37,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:37,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:37,831 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:54:37,832 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:37,858 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:37,870 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:37,879 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:37,890 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:37,923 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:37,924 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:37,928 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:37,935 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:37,945 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:37,967 INFO L309 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-03-04 16:54:37,967 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-03-04 16:54:38,028 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 59 [2019-03-04 16:54:38,031 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:54:38,189 INFO L309 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-03-04 16:54:38,190 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:231 [2019-03-04 16:54:38,337 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-03-04 16:54:38,348 INFO L453 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 55 treesize of output 50 [2019-03-04 16:54:38,349 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,473 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 43 treesize of output 59 [2019-03-04 16:54:38,475 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,591 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:54:38,592 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,687 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:54:38,688 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,749 INFO L309 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-03-04 16:54:38,749 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:197, output treesize:127 [2019-03-04 16:54:38,847 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:54:38,848 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,952 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:54:38,953 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:39,030 INFO L453 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 55 treesize of output 50 [2019-03-04 16:54:39,031 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:39,133 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 53 [2019-03-04 16:54:39,134 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:39,185 INFO L309 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-03-04 16:54:39,186 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:129 [2019-03-04 16:54:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:39,270 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:39,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:39,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:54:39,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:39,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:39,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:39,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:54:39,332 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-03-04 16:54:39,723 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-03-04 16:54:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:40,022 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-03-04 16:54:40,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:54:40,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:54:40,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:40,025 INFO L225 Difference]: With dead ends: 131 [2019-03-04 16:54:40,025 INFO L226 Difference]: Without dead ends: 130 [2019-03-04 16:54:40,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:54:40,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-03-04 16:54:40,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-03-04 16:54:40,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:54:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-03-04 16:54:40,047 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-03-04 16:54:40,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:40,047 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-03-04 16:54:40,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:40,047 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-03-04 16:54:40,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:40,047 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:40,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:40,047 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:40,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:40,048 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-03-04 16:54:40,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:40,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:40,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:40,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:40,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:40,295 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-03-04 16:54:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:40,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:40,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:40,328 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:54:40,328 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-03-04 16:54:40,329 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:40,329 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:40,789 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:40,789 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-03-04 16:54:40,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:40,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:40,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:40,790 INFO 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-03-04 16:54:40,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:40,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:40,803 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:54:40,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:40,809 INFO L453 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-03-04 16:54:40,833 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:54:40,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:40,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:40,849 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:54:40,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:40,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:40,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:40,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:40,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:40,867 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:54:40,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:40,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:40,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:40,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:40,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:40,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:40,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:40,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:40,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:40,883 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:54:40,884 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:40,895 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:40,906 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:40,917 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:40,928 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:40,968 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:40,968 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:40,973 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:40,985 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:41,001 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:41,030 INFO L309 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-03-04 16:54:41,030 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:54:41,056 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:54:41,057 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:41,083 INFO L309 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-03-04 16:54:41,084 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:54:41,117 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:54:41,118 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:41,136 INFO L309 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-03-04 16:54:41,137 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-03-04 16:54:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:41,155 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:41,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:41,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:54:41,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:41,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:41,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:41,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:41,198 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-03-04 16:54:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:43,651 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-03-04 16:54:43,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:54:43,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:54:43,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:43,653 INFO L225 Difference]: With dead ends: 71 [2019-03-04 16:54:43,653 INFO L226 Difference]: Without dead ends: 68 [2019-03-04 16:54:43,653 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-03-04 16:54:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-03-04 16:54:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-03-04 16:54:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-03-04 16:54:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-03-04 16:54:43,677 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-03-04 16:54:43,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:43,677 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-03-04 16:54:43,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:43,677 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-03-04 16:54:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:43,678 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:43,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:43,678 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:43,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:43,678 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-03-04 16:54:43,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:43,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:43,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:43,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:43,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:43,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:43,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:43,727 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:54:43,727 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-03-04 16:54:43,728 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:43,728 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:43,912 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:43,912 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-03-04 16:54:43,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:43,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:43,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:43,913 INFO 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-03-04 16:54:43,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:43,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:43,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:54:43,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:43,956 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:43,956 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:43,963 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:43,975 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:43,991 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,007 INFO L453 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-03-04 16:54:44,010 INFO L453 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 23 [2019-03-04 16:54:44,013 INFO L453 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 25 [2019-03-04 16:54:44,016 INFO L453 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 27 [2019-03-04 16:54:44,047 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:54:44,048 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,056 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,066 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,076 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,086 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,108 INFO L309 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-03-04 16:54:44,108 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:54:44,136 INFO L453 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 31 treesize of output 26 [2019-03-04 16:54:44,136 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,154 INFO L309 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-03-04 16:54:44,155 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-03-04 16:54:44,178 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2019-03-04 16:54:44,178 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,190 INFO L309 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-03-04 16:54:44,190 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-03-04 16:54:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:44,205 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:44,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:44,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:54:44,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:44,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:44,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:44,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:54:44,236 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-03-04 16:54:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:44,508 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-03-04 16:54:44,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:54:44,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:54:44,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:44,510 INFO L225 Difference]: With dead ends: 73 [2019-03-04 16:54:44,510 INFO L226 Difference]: Without dead ends: 72 [2019-03-04 16:54:44,510 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-03-04 16:54:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-03-04 16:54:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-03-04 16:54:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-03-04 16:54:44,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-03-04 16:54:44,536 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-03-04 16:54:44,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:44,536 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-03-04 16:54:44,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-03-04 16:54:44,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:44,536 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:44,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:44,536 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:44,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:44,537 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-03-04 16:54:44,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:44,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:44,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:44,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:44,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:44,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:44,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:44,629 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:54:44,629 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-03-04 16:54:44,630 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:44,630 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:44,887 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:44,888 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-03-04 16:54:44,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:44,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:44,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:44,888 INFO 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-03-04 16:54:44,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:44,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:44,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:54:44,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:44,909 INFO L453 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-03-04 16:54:44,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,919 INFO L453 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 23 [2019-03-04 16:54:44,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,933 INFO L453 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-03-04 16:54:44,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,943 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,947 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,948 INFO L453 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 27 [2019-03-04 16:54:44,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,993 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:54:44,993 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:45,002 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:45,013 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:45,024 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:45,035 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:45,068 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:45,068 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:45,071 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:45,077 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:45,088 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:45,108 INFO L309 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-03-04 16:54:45,108 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:54:45,144 INFO L453 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 31 treesize of output 26 [2019-03-04 16:54:45,145 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:45,162 INFO L309 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-03-04 16:54:45,163 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:54:45,193 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:54:45,194 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:45,207 INFO L309 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-03-04 16:54:45,207 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-03-04 16:54:45,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:45,223 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:45,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:45,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-03-04 16:54:45,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:45,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:54:45,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:54:45,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:54:45,290 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-03-04 16:54:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:45,579 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-03-04 16:54:45,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:54:45,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-03-04 16:54:45,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:45,580 INFO L225 Difference]: With dead ends: 66 [2019-03-04 16:54:45,580 INFO L226 Difference]: Without dead ends: 65 [2019-03-04 16:54:45,581 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-03-04 16:54:45,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-03-04 16:54:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-03-04 16:54:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-03-04 16:54:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-03-04 16:54:45,617 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-03-04 16:54:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:45,617 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-03-04 16:54:45,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:54:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-03-04 16:54:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:45,617 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:45,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:45,618 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:45,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:45,618 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-03-04 16:54:45,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:45,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:45,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:45,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:45,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:45,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:54:45,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:54:45,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:54:45,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:54:45,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:54:45,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:54:45,719 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-03-04 16:54:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:45,792 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-03-04 16:54:45,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:54:45,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-03-04 16:54:45,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:45,794 INFO L225 Difference]: With dead ends: 54 [2019-03-04 16:54:45,794 INFO L226 Difference]: Without dead ends: 51 [2019-03-04 16:54:45,794 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-03-04 16:54:45,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-03-04 16:54:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-03-04 16:54:45,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-03-04 16:54:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-03-04 16:54:45,823 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-03-04 16:54:45,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:45,823 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-03-04 16:54:45,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:54:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-03-04 16:54:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:45,824 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:45,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:45,824 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:45,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:45,825 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-03-04 16:54:45,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:45,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:45,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:45,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:45,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:46,055 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-03-04 16:54:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:46,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:46,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:46,234 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:54:46,235 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-03-04 16:54:46,239 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:46,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:46,427 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:46,427 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-03-04 16:54:46,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:46,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:46,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:46,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 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-03-04 16:54:46,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:46,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:46,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:54:46,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:46,467 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:54:46,467 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,477 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,489 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,505 INFO L453 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-03-04 16:54:46,520 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:54:46,525 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:54:46,530 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:54:46,568 INFO L453 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:54:46,569 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,579 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,590 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,600 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,609 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,628 INFO L309 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-03-04 16:54:46,628 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-03-04 16:54:46,662 INFO L453 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:54:46,663 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:54:46,701 INFO L309 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-03-04 16:54:46,702 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:66 [2019-03-04 16:54:46,739 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 26 [2019-03-04 16:54:46,740 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,747 INFO L309 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-03-04 16:54:46,748 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-03-04 16:54:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:46,761 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:46,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:46,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:54:46,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:46,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:46,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:46,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:54:46,798 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-03-04 16:54:47,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:47,046 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-03-04 16:54:47,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:54:47,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:54:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:47,047 INFO L225 Difference]: With dead ends: 83 [2019-03-04 16:54:47,047 INFO L226 Difference]: Without dead ends: 82 [2019-03-04 16:54:47,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:47,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-03-04 16:54:47,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-03-04 16:54:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-03-04 16:54:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-03-04 16:54:47,091 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-03-04 16:54:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:47,092 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-03-04 16:54:47,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-03-04 16:54:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:47,092 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:47,092 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:54:47,093 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:47,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:47,093 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-03-04 16:54:47,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:47,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:47,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:47,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:47,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:47,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:47,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:47,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:47,243 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:54:47,244 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-03-04 16:54:47,245 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:47,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:47,414 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:47,414 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-03-04 16:54:47,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:47,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:47,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:47,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:54:47,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:47,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:47,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:54:47,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:47,450 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:54:47,451 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:47,460 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:47,474 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:47,496 INFO L453 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-03-04 16:54:47,513 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:54:47,517 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:54:47,522 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:54:47,556 INFO L453 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:54:47,556 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:47,565 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:47,575 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:47,585 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:47,595 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:47,614 INFO L309 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-03-04 16:54:47,614 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-03-04 16:54:47,672 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:54:47,673 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:47,794 INFO L309 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-03-04 16:54:47,794 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-03-04 16:54:47,824 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 29 [2019-03-04 16:54:47,825 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:47,833 INFO L309 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-03-04 16:54:47,833 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-03-04 16:54:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:47,849 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:47,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:47,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:54:47,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:47,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:47,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:47,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:54:47,888 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-03-04 16:54:48,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:48,231 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-03-04 16:54:48,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:54:48,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:54:48,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:48,232 INFO L225 Difference]: With dead ends: 86 [2019-03-04 16:54:48,232 INFO L226 Difference]: Without dead ends: 85 [2019-03-04 16:54:48,233 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-03-04 16:54:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-03-04 16:54:48,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-03-04 16:54:48,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-03-04 16:54:48,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-03-04 16:54:48,291 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-03-04 16:54:48,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:48,292 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-03-04 16:54:48,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:48,292 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-03-04 16:54:48,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:48,292 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:48,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:54:48,293 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:48,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:48,293 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-03-04 16:54:48,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:48,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:48,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:48,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:48,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:48,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:48,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:48,437 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:54:48,437 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-03-04 16:54:48,438 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:48,438 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:48,704 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:48,704 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-03-04 16:54:48,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:48,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:48,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:48,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:54:48,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:48,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:48,720 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:54:48,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:48,770 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:54:48,770 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,773 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,783 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,799 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,818 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,845 INFO L453 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-03-04 16:54:48,847 INFO L453 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 23 [2019-03-04 16:54:48,849 INFO L453 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 25 [2019-03-04 16:54:48,851 INFO L453 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 27 [2019-03-04 16:54:48,855 INFO L453 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 26 [2019-03-04 16:54:48,855 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,865 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,876 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,886 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,896 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,926 INFO L309 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-03-04 16:54:48,927 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:54:48,962 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:54:48,962 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,991 INFO L309 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-03-04 16:54:48,992 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:54:49,032 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:54:49,033 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:49,053 INFO L309 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-03-04 16:54:49,054 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-03-04 16:54:49,103 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:54:49,104 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:49,123 INFO L309 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-03-04 16:54:49,123 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-03-04 16:54:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:49,144 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:49,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:49,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:54:49,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:49,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:49,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:49,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:54:49,205 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-03-04 16:54:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:49,752 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-03-04 16:54:49,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:54:49,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:54:49,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:49,754 INFO L225 Difference]: With dead ends: 100 [2019-03-04 16:54:49,754 INFO L226 Difference]: Without dead ends: 99 [2019-03-04 16:54:49,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:54:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-03-04 16:54:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-03-04 16:54:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-03-04 16:54:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-03-04 16:54:49,831 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-03-04 16:54:49,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:49,832 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-03-04 16:54:49,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:49,832 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-03-04 16:54:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:49,832 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:49,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:54:49,833 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:49,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:49,833 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-03-04 16:54:49,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:49,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:49,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:49,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:49,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:49,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:49,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:49,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:49,918 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:54:49,918 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-03-04 16:54:49,919 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:49,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:50,177 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:50,178 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-03-04 16:54:50,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:50,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:50,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:50,178 INFO 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-03-04 16:54:50,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:50,187 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:50,192 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:54:50,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:50,226 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:50,227 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:50,238 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:50,259 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:50,279 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:50,303 INFO L453 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-03-04 16:54:50,315 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:54:50,321 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:54:50,339 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:54:50,343 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:54:50,343 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:50,353 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:50,363 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:50,373 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:50,383 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:50,410 INFO L309 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-03-04 16:54:50,410 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:54:50,455 INFO L453 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 31 treesize of output 26 [2019-03-04 16:54:50,456 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:50,475 INFO L309 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-03-04 16:54:50,476 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:50,508 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:54:50,509 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:50,522 INFO L309 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-03-04 16:54:50,522 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:50,585 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:54:50,586 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:50,602 INFO L309 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-03-04 16:54:50,602 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:54:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:50,638 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:50,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:50,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:54:50,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:50,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:50,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:50,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:54:50,863 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-03-04 16:54:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:51,350 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-03-04 16:54:51,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:54:51,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:54:51,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:51,352 INFO L225 Difference]: With dead ends: 104 [2019-03-04 16:54:51,352 INFO L226 Difference]: Without dead ends: 103 [2019-03-04 16:54:51,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:54:51,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-03-04 16:54:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-03-04 16:54:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-03-04 16:54:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-03-04 16:54:51,450 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-03-04 16:54:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:51,450 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-03-04 16:54:51,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-03-04 16:54:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:51,451 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:51,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:54:51,451 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:51,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:51,452 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-03-04 16:54:51,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:51,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:51,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:51,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:51,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:51,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:51,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:51,511 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:54:51,511 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-03-04 16:54:51,512 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:51,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:51,777 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:51,778 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-03-04 16:54:51,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:51,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:51,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:51,778 INFO 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-03-04 16:54:51,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:51,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:51,794 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:54:51,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:51,823 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:51,823 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:51,833 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:51,842 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:51,857 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:51,875 INFO L453 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-03-04 16:54:51,878 INFO L453 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 23 [2019-03-04 16:54:51,881 INFO L453 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 25 [2019-03-04 16:54:51,884 INFO L453 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 27 [2019-03-04 16:54:51,915 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:54:51,916 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:51,924 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:51,934 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:51,944 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:51,953 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:51,973 INFO L309 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-03-04 16:54:51,974 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-03-04 16:54:52,017 INFO L453 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 31 treesize of output 26 [2019-03-04 16:54:52,018 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:52,033 INFO L309 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-03-04 16:54:52,034 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:52,064 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:54:52,065 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:52,078 INFO L309 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-03-04 16:54:52,078 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:52,123 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:54:52,124 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:52,135 INFO L309 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-03-04 16:54:52,136 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:54:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:52,153 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:52,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:52,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:52,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:54:52,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:52,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:52,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:52,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:54:52,209 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-03-04 16:54:52,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:52,775 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-03-04 16:54:52,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:54:52,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:54:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:52,777 INFO L225 Difference]: With dead ends: 107 [2019-03-04 16:54:52,777 INFO L226 Difference]: Without dead ends: 106 [2019-03-04 16:54:52,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:54:52,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-03-04 16:54:52,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-03-04 16:54:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-03-04 16:54:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-03-04 16:54:52,871 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-03-04 16:54:52,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:52,872 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-03-04 16:54:52,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:52,872 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-03-04 16:54:52,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:52,872 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:52,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:54:52,873 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:52,873 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-03-04 16:54:52,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:52,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:52,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:52,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:52,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:53,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:53,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:53,003 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:54:53,004 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-03-04 16:54:53,005 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:53,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:53,236 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:53,236 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-03-04 16:54:53,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:53,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:53,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:53,237 INFO 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-03-04 16:54:53,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:53,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:53,253 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:54:53,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:53,259 INFO L453 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-03-04 16:54:53,283 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:54:53,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:53,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:53,301 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:54:53,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:53,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:53,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:53,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:53,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:53,316 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:54:53,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:53,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:53,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:53,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:53,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:53,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:53,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:53,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:53,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:53,333 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:54:53,334 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:53,344 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:53,353 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:53,363 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:53,374 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:53,408 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:53,408 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:53,413 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:53,424 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:53,440 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:53,469 INFO L309 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-03-04 16:54:53,469 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:54:53,506 INFO L453 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 31 treesize of output 26 [2019-03-04 16:54:53,506 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:53,524 INFO L309 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-03-04 16:54:53,524 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:54:53,554 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:54:53,555 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:53,570 INFO L309 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-03-04 16:54:53,570 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-03-04 16:54:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:53,590 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:53,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:53,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:54:53,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:53,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:53,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:53,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:53,632 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-03-04 16:54:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:54,033 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-03-04 16:54:54,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:54:54,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:54:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:54,035 INFO L225 Difference]: With dead ends: 100 [2019-03-04 16:54:54,035 INFO L226 Difference]: Without dead ends: 98 [2019-03-04 16:54:54,036 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-03-04 16:54:54,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-03-04 16:54:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-03-04 16:54:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-03-04 16:54:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-03-04 16:54:54,136 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-03-04 16:54:54,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:54,136 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-03-04 16:54:54,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-03-04 16:54:54,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:54,137 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:54,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:54:54,137 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:54,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:54,137 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-03-04 16:54:54,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:54,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:54,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:54,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:54,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:54,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:54,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:54,236 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:54:54,236 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-03-04 16:54:54,238 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:54,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:54,856 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:54,856 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-03-04 16:54:54,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:54,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:54,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:54,857 INFO 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-03-04 16:54:54,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:54,887 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:54,893 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:54:54,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:54,919 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:54,920 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:54,930 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:54,947 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:54,959 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:54,978 INFO L453 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-03-04 16:54:54,981 INFO L453 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 23 [2019-03-04 16:54:54,986 INFO L453 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 25 [2019-03-04 16:54:54,988 INFO L453 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 27 [2019-03-04 16:54:55,018 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:54:55,019 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,029 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,039 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,049 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,059 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,080 INFO L309 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-03-04 16:54:55,081 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:54:55,137 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 59 [2019-03-04 16:54:55,140 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:54:55,238 INFO L309 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-03-04 16:54:55,238 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:231 [2019-03-04 16:54:55,429 INFO L453 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 49 [2019-03-04 16:54:55,430 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,514 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:54:55,515 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,584 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:54:55,585 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,629 INFO L309 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-03-04 16:54:55,629 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:158, output treesize:92 [2019-03-04 16:54:55,737 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 48 [2019-03-04 16:54:55,738 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,824 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:54:55,825 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,934 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 48 [2019-03-04 16:54:55,935 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,991 INFO L309 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-03-04 16:54:55,992 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:88 [2019-03-04 16:54:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:56,054 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:56,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:56,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:54:56,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:56,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:56,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:56,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:54:56,129 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-03-04 16:54:57,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:57,079 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-03-04 16:54:57,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:54:57,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:54:57,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:57,081 INFO L225 Difference]: With dead ends: 124 [2019-03-04 16:54:57,081 INFO L226 Difference]: Without dead ends: 123 [2019-03-04 16:54:57,082 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-03-04 16:54:57,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-03-04 16:54:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-03-04 16:54:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-03-04 16:54:57,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-03-04 16:54:57,192 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-03-04 16:54:57,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:57,193 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-03-04 16:54:57,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-03-04 16:54:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:57,193 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:57,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:54:57,194 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:57,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:57,194 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-03-04 16:54:57,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:57,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:57,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:57,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:57,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:57,329 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:54:57,480 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-03-04 16:54:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:57,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:57,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:57,656 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:54:57,657 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-03-04 16:54:57,657 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:57,658 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:58,338 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:58,339 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-03-04 16:54:58,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:58,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:58,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:58,339 INFO 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-03-04 16:54:58,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:58,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:58,357 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:54:58,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:58,365 INFO L453 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-03-04 16:54:58,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,369 INFO L453 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 23 [2019-03-04 16:54:58,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,379 INFO L453 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-03-04 16:54:58,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,404 INFO L453 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 27 [2019-03-04 16:54:58,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,428 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,429 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:58,430 INFO L453 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 26 [2019-03-04 16:54:58,431 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:58,442 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:58,451 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:58,463 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:58,473 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:58,516 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:54:58,517 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:58,525 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:58,533 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:58,546 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:58,564 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:58,595 INFO L309 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-03-04 16:54:58,595 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:54:58,658 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:54:58,659 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:58,705 INFO L309 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-03-04 16:54:58,705 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 16:54:58,743 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:54:58,744 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:58,765 INFO L309 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-03-04 16:54:58,766 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-03-04 16:54:58,838 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:54:58,839 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:58,860 INFO L309 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-03-04 16:54:58,860 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:54:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:58,883 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:58,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:58,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:54:58,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:58,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:54:58,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:54:58,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:54:58,940 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-03-04 16:55:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:03,492 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-03-04 16:55:03,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:55:03,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:55:03,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:03,494 INFO L225 Difference]: With dead ends: 114 [2019-03-04 16:55:03,494 INFO L226 Difference]: Without dead ends: 113 [2019-03-04 16:55:03,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:55:03,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-03-04 16:55:03,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-03-04 16:55:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-03-04 16:55:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-03-04 16:55:03,616 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-03-04 16:55:03,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:03,616 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-03-04 16:55:03,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:55:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-03-04 16:55:03,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:55:03,617 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:03,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:55:03,617 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:03,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:03,617 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-03-04 16:55:03,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:03,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:03,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:03,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:03,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:03,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:03,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:03,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:03,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:03,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:03,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:03,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 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-03-04 16:55:03,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:55:03,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:55:03,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:55:03,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:03,765 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:55:03,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:03,778 INFO L453 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-03-04 16:55:03,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,813 INFO L453 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 23 [2019-03-04 16:55:03,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,825 INFO L453 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-03-04 16:55:03,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,840 INFO L453 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 27 [2019-03-04 16:55:03,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,856 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:03,856 INFO L453 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 26 [2019-03-04 16:55:03,857 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:03,867 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:03,877 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:03,889 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:03,900 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:03,946 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:55:03,947 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:03,949 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:03,958 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:03,973 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:03,991 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:04,022 INFO L309 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-03-04 16:55:04,023 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-03-04 16:55:04,046 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:55:04,047 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:04,075 INFO L309 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-03-04 16:55:04,076 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:55:04,117 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:55:04,118 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:04,138 INFO L309 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-03-04 16:55:04,138 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:40 [2019-03-04 16:55:04,184 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:55:04,185 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:04,202 INFO L309 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-03-04 16:55:04,202 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-03-04 16:55:04,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:04,220 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:04,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:04,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:04,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:55:04,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:04,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:55:04,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:55:04,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:55:04,265 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-03-04 16:55:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:04,853 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-03-04 16:55:04,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:55:04,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:55:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:04,855 INFO L225 Difference]: With dead ends: 164 [2019-03-04 16:55:04,855 INFO L226 Difference]: Without dead ends: 163 [2019-03-04 16:55:04,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:55:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-03-04 16:55:05,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-03-04 16:55:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-03-04 16:55:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-03-04 16:55:05,070 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-03-04 16:55:05,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:05,070 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-03-04 16:55:05,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:55:05,071 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-03-04 16:55:05,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:55:05,071 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:05,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:55:05,071 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:05,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:05,072 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-03-04 16:55:05,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:05,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:05,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:05,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:05,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:55:05,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:05,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:05,126 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:55:05,126 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-03-04 16:55:05,127 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:05,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:05,561 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:05,561 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-03-04 16:55:05,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:05,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:05,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:05,562 INFO 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-03-04 16:55:05,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:05,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:05,575 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:55:05,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:05,602 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:55:05,603 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:05,611 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:05,624 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:05,646 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:05,670 INFO L453 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-03-04 16:55:05,683 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:55:05,688 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:55:05,699 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:55:05,703 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:55:05,703 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:05,713 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:05,723 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:05,733 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:05,743 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:05,770 INFO L309 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-03-04 16:55:05,771 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:55:05,796 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:55:05,797 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:05,823 INFO L309 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-03-04 16:55:05,824 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:55:05,903 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:55:05,904 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:55:05,951 INFO L309 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-03-04 16:55:05,951 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-03-04 16:55:05,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:05,988 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:06,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:06,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:55:06,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:06,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:55:06,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:55:06,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:55:06,075 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-03-04 16:55:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:06,700 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-03-04 16:55:06,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:55:06,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:55:06,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:06,703 INFO L225 Difference]: With dead ends: 160 [2019-03-04 16:55:06,703 INFO L226 Difference]: Without dead ends: 159 [2019-03-04 16:55:06,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:55:06,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-03-04 16:55:07,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-03-04 16:55:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-03-04 16:55:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-03-04 16:55:07,061 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-03-04 16:55:07,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:07,062 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-03-04 16:55:07,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:55:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-03-04 16:55:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:55:07,063 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:07,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:55:07,063 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:07,063 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-03-04 16:55:07,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:07,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:07,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:07,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:07,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:55:07,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:07,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:07,138 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:55:07,138 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-03-04 16:55:07,139 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:07,139 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:07,351 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:07,352 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-03-04 16:55:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:07,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:07,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:07,352 INFO 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-03-04 16:55:07,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:07,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:07,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:55:07,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:07,418 INFO L453 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-03-04 16:55:07,563 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:55:07,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:07,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:07,672 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:55:07,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:07,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:07,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:07,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:07,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:07,838 INFO L301 Elim1Store]: Index analysis took 139 ms [2019-03-04 16:55:07,852 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:55:07,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:07,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:07,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:08,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:08,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:08,026 INFO L301 Elim1Store]: Index analysis took 144 ms [2019-03-04 16:55:08,472 INFO L453 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:55:08,473 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:08,611 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:08,749 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:08,888 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:09,037 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:09,078 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:55:09,078 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:09,083 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:09,092 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:09,111 INFO L309 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-03-04 16:55:09,112 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-03-04 16:55:09,143 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:55:09,144 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:09,154 INFO L309 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-03-04 16:55:09,154 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-03-04 16:55:09,177 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 24 [2019-03-04 16:55:09,178 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:09,185 INFO L309 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-03-04 16:55:09,186 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2019-03-04 16:55:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:09,199 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:09,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:09,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:55:09,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:09,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:55:09,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:55:09,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:55:09,336 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-03-04 16:55:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:09,854 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-03-04 16:55:09,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:55:09,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:55:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:09,857 INFO L225 Difference]: With dead ends: 175 [2019-03-04 16:55:09,857 INFO L226 Difference]: Without dead ends: 174 [2019-03-04 16:55:09,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:55:09,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-03-04 16:55:10,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-03-04 16:55:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-03-04 16:55:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-03-04 16:55:10,089 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-03-04 16:55:10,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:10,089 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-03-04 16:55:10,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:55:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-03-04 16:55:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:55:10,090 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:10,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:55:10,090 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:10,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-03-04 16:55:10,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:10,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:10,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:10,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:10,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:10,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:55:10,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:55:10,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:55:10,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:55:10,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:55:10,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:55:10,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:55:10,176 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-03-04 16:55:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:10,600 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-03-04 16:55:10,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:55:10,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-03-04 16:55:10,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:10,602 INFO L225 Difference]: With dead ends: 185 [2019-03-04 16:55:10,602 INFO L226 Difference]: Without dead ends: 184 [2019-03-04 16:55:10,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:55:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-03-04 16:55:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-03-04 16:55:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-03-04 16:55:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-03-04 16:55:10,825 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-03-04 16:55:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:10,825 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-03-04 16:55:10,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:55:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-03-04 16:55:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:55:10,826 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:10,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:55:10,826 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:10,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:10,826 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-03-04 16:55:10,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:10,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:10,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:10,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:10,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:55:10,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:10,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:10,883 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:55:10,883 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-03-04 16:55:10,884 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:10,884 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:11,079 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:11,079 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-03-04 16:55:11,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:11,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:11,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:11,079 INFO 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-03-04 16:55:11,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:11,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:11,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:55:11,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:11,110 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:55:11,110 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,122 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,136 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,155 INFO L453 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-03-04 16:55:11,173 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:55:11,183 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:55:11,195 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:55:11,246 INFO L453 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:55:11,246 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,259 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,272 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,284 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,300 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,326 INFO L309 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-03-04 16:55:11,327 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-03-04 16:55:11,372 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:55:11,372 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,391 INFO L309 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-03-04 16:55:11,391 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-03-04 16:55:11,439 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:55:11,439 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,453 INFO L309 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-03-04 16:55:11,454 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:55:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:11,506 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:11,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:11,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:55:11,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:11,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:55:11,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:55:11,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:55:11,545 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-03-04 16:55:12,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:12,023 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-03-04 16:55:12,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:55:12,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:55:12,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:12,025 INFO L225 Difference]: With dead ends: 142 [2019-03-04 16:55:12,026 INFO L226 Difference]: Without dead ends: 141 [2019-03-04 16:55:12,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:55:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-03-04 16:55:12,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-03-04 16:55:12,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-03-04 16:55:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-03-04 16:55:12,258 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-03-04 16:55:12,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:12,259 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-03-04 16:55:12,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:55:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-03-04 16:55:12,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:55:12,259 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:12,259 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:55:12,260 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:12,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:12,260 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-03-04 16:55:12,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:12,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:12,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:12,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:12,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:55:12,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:12,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:12,311 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:55:12,311 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-03-04 16:55:12,312 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:12,312 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:12,781 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:12,781 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-03-04 16:55:12,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:12,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:12,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:12,781 INFO 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-03-04 16:55:12,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:12,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:12,795 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:55:12,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:12,803 INFO L453 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-03-04 16:55:12,824 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:55:12,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,840 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:55:12,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,864 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:55:12,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,873 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,880 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:55:12,880 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:12,890 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:12,899 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:12,908 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:12,919 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:12,956 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:55:12,956 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:12,961 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:12,972 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:12,988 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:13,016 INFO L309 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-03-04 16:55:13,017 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 16:55:13,045 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:55:13,046 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:55:13,090 INFO L309 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-03-04 16:55:13,090 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:100 [2019-03-04 16:55:13,162 INFO L453 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:55:13,162 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:13,178 INFO L309 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-03-04 16:55:13,179 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-03-04 16:55:13,236 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 49 [2019-03-04 16:55:13,237 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:13,251 INFO L309 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-03-04 16:55:13,252 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:55:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:13,269 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:13,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:13,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-03-04 16:55:13,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:13,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:55:13,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:55:13,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:55:13,312 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-03-04 16:55:14,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:14,003 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-03-04 16:55:14,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:55:14,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:55:14,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:14,006 INFO L225 Difference]: With dead ends: 219 [2019-03-04 16:55:14,007 INFO L226 Difference]: Without dead ends: 216 [2019-03-04 16:55:14,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:55:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-03-04 16:55:14,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-03-04 16:55:14,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-03-04 16:55:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-03-04 16:55:14,302 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-03-04 16:55:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:14,303 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-03-04 16:55:14,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:55:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-03-04 16:55:14,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:55:14,303 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:14,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:55:14,304 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:14,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:14,304 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-03-04 16:55:14,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:14,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:14,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:14,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:14,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:55:14,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:14,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:14,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:14,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:14,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:14,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 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-03-04 16:55:14,413 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:55:14,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:55:14,418 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:55:14,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:14,419 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:55:14,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:14,442 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:55:14,442 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:14,453 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:14,463 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:14,475 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:14,490 INFO L453 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-03-04 16:55:14,493 INFO L453 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 23 [2019-03-04 16:55:14,496 INFO L453 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 25 [2019-03-04 16:55:14,499 INFO L453 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 27 [2019-03-04 16:55:14,530 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:55:14,531 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:14,541 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:14,551 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:14,561 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:14,571 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:14,592 INFO L309 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-03-04 16:55:14,592 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:55:14,625 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:55:14,625 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:55:14,663 INFO L309 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-03-04 16:55:14,664 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:79 [2019-03-04 16:55:14,733 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 16:55:14,734 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:55:14,830 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 50 [2019-03-04 16:55:14,831 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:14,878 INFO L309 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-03-04 16:55:14,879 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-03-04 16:55:14,982 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 17 case distinctions, treesize of input 42 treesize of output 65 [2019-03-04 16:55:14,984 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-03-04 16:55:15,124 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 49 [2019-03-04 16:55:15,125 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:15,236 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 41 [2019-03-04 16:55:15,237 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:15,313 INFO L309 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-03-04 16:55:15,313 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-03-04 16:55:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:15,405 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:15,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:15,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:55:15,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:15,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:55:15,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:55:15,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:55:15,474 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-03-04 16:55:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:16,625 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-03-04 16:55:16,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:55:16,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:55:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:16,628 INFO L225 Difference]: With dead ends: 218 [2019-03-04 16:55:16,629 INFO L226 Difference]: Without dead ends: 215 [2019-03-04 16:55:16,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:55:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-03-04 16:55:16,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-03-04 16:55:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-03-04 16:55:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-03-04 16:55:16,961 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-03-04 16:55:16,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:16,961 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-03-04 16:55:16,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:55:16,961 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-03-04 16:55:16,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:55:16,962 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:16,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:55:16,962 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:16,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:16,963 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-03-04 16:55:16,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:16,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:16,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:16,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:16,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:17,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:17,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:17,016 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:55:17,016 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-03-04 16:55:17,017 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:17,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:17,217 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:17,217 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-03-04 16:55:17,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:17,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:17,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:17,218 INFO 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-03-04 16:55:17,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:17,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:17,281 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:55:17,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:17,539 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:55:17,540 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:17,546 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:17,556 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:17,571 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:17,594 INFO L453 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-03-04 16:55:17,604 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:55:17,610 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:55:17,614 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:55:17,620 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:55:17,620 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:17,630 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:17,640 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:17,650 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:17,660 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:17,689 INFO L309 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-03-04 16:55:17,689 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 16:55:17,707 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:55:17,708 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:17,735 INFO L309 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-03-04 16:55:17,736 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:55:17,764 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:55:17,765 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:17,784 INFO L309 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-03-04 16:55:17,784 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:36 [2019-03-04 16:55:17,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-03-04 16:55:17,801 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:17,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:17,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:55:17,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:17,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:55:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:55:17,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:55:17,832 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-03-04 16:55:18,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:18,623 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-03-04 16:55:18,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:55:18,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:55:18,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:18,626 INFO L225 Difference]: With dead ends: 274 [2019-03-04 16:55:18,626 INFO L226 Difference]: Without dead ends: 269 [2019-03-04 16:55:18,627 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-03-04 16:55:18,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-03-04 16:55:19,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-03-04 16:55:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-03-04 16:55:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-03-04 16:55:19,097 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-03-04 16:55:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:19,098 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-03-04 16:55:19,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:55:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-03-04 16:55:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:55:19,098 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:19,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:55:19,099 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:19,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:19,099 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-03-04 16:55:19,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:19,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:19,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:19,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:19,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:19,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:19,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:19,212 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:55:19,212 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-03-04 16:55:19,213 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:19,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:20,039 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:20,040 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-03-04 16:55:20,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:20,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:20,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:20,040 INFO 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-03-04 16:55:20,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:20,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:20,078 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:55:20,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:20,109 INFO L453 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-03-04 16:55:20,233 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:55:20,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:20,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:20,241 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:55:20,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:20,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:20,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:20,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:20,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:20,254 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:55:20,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:20,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:20,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:20,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:20,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:20,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:20,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:20,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:20,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:20,296 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:55:20,297 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,308 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,319 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,329 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,340 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,375 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:55:20,376 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,384 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,395 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,411 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,439 INFO L309 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-03-04 16:55:20,440 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:55:20,466 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:55:20,467 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,494 INFO L309 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-03-04 16:55:20,494 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:55:20,530 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:55:20,531 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:55:20,567 INFO L309 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-03-04 16:55:20,568 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:76 [2019-03-04 16:55:20,628 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:55:20,628 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,640 INFO L309 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-03-04 16:55:20,640 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-03-04 16:55:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:20,657 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:20,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:20,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:20,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-03-04 16:55:20,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:20,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:55:20,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:55:20,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:55:20,695 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-03-04 16:55:22,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:22,234 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-03-04 16:55:22,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:55:22,235 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:55:22,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:22,239 INFO L225 Difference]: With dead ends: 480 [2019-03-04 16:55:22,239 INFO L226 Difference]: Without dead ends: 477 [2019-03-04 16:55:22,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:55:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-03-04 16:55:23,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-03-04 16:55:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-03-04 16:55:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-03-04 16:55:23,085 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-03-04 16:55:23,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:23,085 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-03-04 16:55:23,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:55:23,085 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-03-04 16:55:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:55:23,086 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:23,087 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:55:23,087 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:23,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:23,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-03-04 16:55:23,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:23,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:23,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:23,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:23,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:23,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:23,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:23,125 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:55:23,126 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-03-04 16:55:23,126 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:23,127 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:23,316 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:23,316 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-03-04 16:55:23,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:23,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:23,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:23,317 INFO 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-03-04 16:55:23,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:23,332 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:23,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2019-03-04 16:55:23,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:23,350 INFO L453 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-03-04 16:55:23,370 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:55:23,397 INFO L453 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:55:23,429 INFO L453 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-03-04 16:55:23,465 INFO L453 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 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:55:23,466 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:23,474 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:23,483 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:23,493 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:23,503 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:23,513 INFO L309 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-03-04 16:55:23,513 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-03-04 16:55:23,518 INFO L453 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 16 treesize of output 11 [2019-03-04 16:55:23,518 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:23,519 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:23,519 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-03-04 16:55:23,525 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2019-03-04 16:55:23,525 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:23,527 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:23,527 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:7 [2019-03-04 16:55:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:23,533 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:23,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:55:23,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-03-04 16:55:23,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:55:23,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:55:23,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:55:23,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:55:23,557 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-03-04 16:55:25,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:25,440 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-03-04 16:55:25,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:55:25,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-03-04 16:55:25,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:25,448 INFO L225 Difference]: With dead ends: 804 [2019-03-04 16:55:25,448 INFO L226 Difference]: Without dead ends: 800 [2019-03-04 16:55:25,448 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-03-04 16:55:25,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-03-04 16:55:27,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-03-04 16:55:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-03-04 16:55:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-03-04 16:55:27,484 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-03-04 16:55:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:27,484 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-03-04 16:55:27,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:55:27,484 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-03-04 16:55:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:55:27,487 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:27,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:55:27,488 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:27,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:27,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-03-04 16:55:27,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:27,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:27,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:27,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:27,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:27,668 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-03-04 16:55:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:55:27,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:27,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:27,777 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:55:27,777 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-03-04 16:55:27,779 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:27,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:28,254 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:28,254 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-03-04 16:55:28,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:28,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:28,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:28,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:55:28,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:28,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:28,271 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:55:28,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:28,275 INFO L453 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-03-04 16:55:28,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,280 INFO L453 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 23 [2019-03-04 16:55:28,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,296 INFO L453 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-03-04 16:55:28,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,312 INFO L453 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 27 [2019-03-04 16:55:28,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,332 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:28,341 INFO L453 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 26 [2019-03-04 16:55:28,341 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:28,353 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:28,363 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:28,373 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:28,383 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:28,425 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:55:28,426 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:28,434 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:28,445 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:28,461 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:28,479 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:28,508 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:28,508 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-03-04 16:55:28,546 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:55:28,547 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:28,574 INFO L309 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-03-04 16:55:28,575 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2019-03-04 16:55:28,616 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:55:28,616 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:28,635 INFO L309 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-03-04 16:55:28,635 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 16:55:28,686 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:55:28,687 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:28,702 INFO L309 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-03-04 16:55:28,703 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-03-04 16:55:28,770 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 54 [2019-03-04 16:55:28,771 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:28,790 INFO L309 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-03-04 16:55:28,790 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-03-04 16:55:28,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:28,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:28,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:28,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:55:28,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:28,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:55:28,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:55:28,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:55:28,894 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-03-04 16:55:31,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:31,531 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-03-04 16:55:31,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:55:31,532 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:55:31,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:31,539 INFO L225 Difference]: With dead ends: 821 [2019-03-04 16:55:31,539 INFO L226 Difference]: Without dead ends: 820 [2019-03-04 16:55:31,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:55:31,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-03-04 16:55:33,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-03-04 16:55:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-03-04 16:55:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-03-04 16:55:33,444 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-03-04 16:55:33,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:33,444 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-03-04 16:55:33,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:55:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-03-04 16:55:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:55:33,446 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:33,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:55:33,446 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:33,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:33,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-03-04 16:55:33,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:33,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:33,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:33,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:33,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:33,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:33,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:33,496 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:55:33,496 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-03-04 16:55:33,496 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:33,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:33,698 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:33,698 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-03-04 16:55:33,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:33,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:33,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:33,699 INFO 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-03-04 16:55:33,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:33,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:33,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:55:33,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:33,733 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2019-03-04 16:55:33,734 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:33,751 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:33,773 INFO L453 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-03-04 16:55:33,784 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:55:33,801 INFO L453 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:55:33,837 INFO L453 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-03-04 16:55:33,847 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:55:33,848 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:33,856 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:33,867 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:33,877 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:33,887 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:33,905 INFO L309 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-03-04 16:55:33,905 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-03-04 16:55:33,929 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:55:33,929 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:33,934 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:33,935 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:13 [2019-03-04 16:55:33,952 INFO L453 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 21 [2019-03-04 16:55:33,953 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:33,957 INFO L309 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-03-04 16:55:33,957 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-03-04 16:55:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:33,970 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:34,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:34,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:55:34,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:34,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:55:34,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:55:34,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:55:34,013 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-03-04 16:55:36,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:36,101 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-03-04 16:55:36,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:55:36,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:55:36,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:36,107 INFO L225 Difference]: With dead ends: 805 [2019-03-04 16:55:36,108 INFO L226 Difference]: Without dead ends: 804 [2019-03-04 16:55:36,108 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-03-04 16:55:36,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-03-04 16:55:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-03-04 16:55:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-03-04 16:55:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-03-04 16:55:38,068 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-03-04 16:55:38,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:38,068 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-03-04 16:55:38,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:55:38,068 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-03-04 16:55:38,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:55:38,070 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:38,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:55:38,071 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:38,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:38,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-03-04 16:55:38,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:38,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:38,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:38,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:38,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:38,230 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-03-04 16:55:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:55:38,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:38,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:38,276 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:55:38,277 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-03-04 16:55:38,277 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:38,278 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:38,540 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:38,540 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-03-04 16:55:38,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:38,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:38,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:38,541 INFO 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-03-04 16:55:38,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:38,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:38,553 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:55:38,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:38,559 INFO L453 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-03-04 16:55:38,577 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:55:38,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:38,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:38,590 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:55:38,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:38,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:38,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:38,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:38,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:38,609 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:55:38,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:38,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:38,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:38,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:38,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:38,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:38,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:38,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:38,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:38,633 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:55:38,633 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:38,643 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:38,652 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:38,662 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:38,673 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:38,708 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:55:38,709 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:38,715 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:38,724 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:38,740 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:38,768 INFO L309 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-03-04 16:55:38,769 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:55:38,815 INFO L453 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 31 treesize of output 26 [2019-03-04 16:55:38,815 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:38,833 INFO L309 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-03-04 16:55:38,834 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:55:38,862 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:55:38,863 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:38,874 INFO L309 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-03-04 16:55:38,875 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:55:38,935 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:55:38,935 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:38,946 INFO L309 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-03-04 16:55:38,947 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:55:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:38,966 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:39,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:39,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:55:39,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:39,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:55:39,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:55:39,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:55:39,032 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-03-04 16:55:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:41,840 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-03-04 16:55:41,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:55:41,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:55:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:41,850 INFO L225 Difference]: With dead ends: 1004 [2019-03-04 16:55:41,850 INFO L226 Difference]: Without dead ends: 1003 [2019-03-04 16:55:41,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:55:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-03-04 16:55:43,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-03-04 16:55:43,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-03-04 16:55:43,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-03-04 16:55:43,976 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-03-04 16:55:43,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:43,976 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-03-04 16:55:43,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:55:43,976 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-03-04 16:55:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:55:43,979 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:43,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:55:43,979 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:43,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:43,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-03-04 16:55:43,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:43,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:43,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:43,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:43,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:44,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:44,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:44,125 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:55:44,125 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-03-04 16:55:44,126 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:44,127 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:44,328 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:44,328 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-03-04 16:55:44,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:44,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:44,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:44,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:55:44,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:44,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:44,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:55:44,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:44,359 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:55:44,359 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:44,365 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:44,377 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:44,402 INFO L453 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-03-04 16:55:44,421 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:55:44,426 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:55:44,432 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:55:44,465 INFO L453 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:55:44,466 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:44,474 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:44,484 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:44,493 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:44,503 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:44,523 INFO L309 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-03-04 16:55:44,523 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-03-04 16:55:44,577 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:55:44,577 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:44,592 INFO L309 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-03-04 16:55:44,592 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:31 [2019-03-04 16:55:44,628 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:55:44,629 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:55:44,653 INFO L309 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-03-04 16:55:44,654 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:50 [2019-03-04 16:55:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:44,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:44,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:44,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-03-04 16:55:44,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:44,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:55:44,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:55:44,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:55:44,781 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-03-04 16:55:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:47,977 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-03-04 16:55:47,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:55:47,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-03-04 16:55:47,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:47,986 INFO L225 Difference]: With dead ends: 1213 [2019-03-04 16:55:47,986 INFO L226 Difference]: Without dead ends: 1212 [2019-03-04 16:55:47,987 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-03-04 16:55:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-03-04 16:55:50,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-03-04 16:55:50,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-03-04 16:55:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-03-04 16:55:50,774 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-03-04 16:55:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:50,775 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-03-04 16:55:50,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:55:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-03-04 16:55:50,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:55:50,777 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:50,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:55:50,777 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:50,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:50,778 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-03-04 16:55:50,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:50,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:50,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:50,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:50,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:50,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:50,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:50,961 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:55:50,961 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-03-04 16:55:50,962 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:50,962 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:51,283 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:51,284 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-03-04 16:55:51,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:51,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:51,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:51,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 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-03-04 16:55:51,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:51,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:51,298 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:55:51,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:51,335 INFO L453 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-03-04 16:55:51,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,340 INFO L453 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 23 [2019-03-04 16:55:51,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,350 INFO L453 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-03-04 16:55:51,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,370 INFO L453 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 27 [2019-03-04 16:55:51,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,395 INFO L453 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 26 [2019-03-04 16:55:51,395 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:51,406 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:51,417 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:51,428 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:51,440 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:51,482 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:55:51,482 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:51,488 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:51,496 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:51,511 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:51,529 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:51,559 INFO L309 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-03-04 16:55:51,560 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:55:51,591 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:55:51,592 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:51,621 INFO L309 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-03-04 16:55:51,621 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:55:51,660 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:55:51,661 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:51,682 INFO L309 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-03-04 16:55:51,683 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46 [2019-03-04 16:55:51,735 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 45 [2019-03-04 16:55:51,736 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:51,752 INFO L309 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-03-04 16:55:51,753 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-03-04 16:55:51,814 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 40 treesize of output 52 [2019-03-04 16:55:51,814 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:51,830 INFO L309 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-03-04 16:55:51,830 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:55:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:51,852 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:51,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:51,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:55:51,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:51,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:55:51,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:55:51,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:55:51,919 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-03-04 16:55:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:56,242 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-03-04 16:55:56,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:55:56,242 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:55:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:56,257 INFO L225 Difference]: With dead ends: 1577 [2019-03-04 16:55:56,257 INFO L226 Difference]: Without dead ends: 1575 [2019-03-04 16:55:56,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:55:56,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-03-04 16:55:58,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-03-04 16:55:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-03-04 16:55:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-03-04 16:55:58,238 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-03-04 16:55:58,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:58,239 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-03-04 16:55:58,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:55:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-03-04 16:55:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:55:58,240 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:58,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:55:58,241 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-03-04 16:55:58,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:58,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:58,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:58,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:58,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:55:58,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:58,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:58,374 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:55:58,375 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-03-04 16:55:58,376 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:58,376 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:58,675 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:58,675 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-03-04 16:55:58,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:58,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:58,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:58,676 INFO 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-03-04 16:55:58,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:58,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:58,689 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:55:58,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:58,694 INFO L453 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-03-04 16:55:58,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:58,701 INFO L453 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 23 [2019-03-04 16:55:58,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:58,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:58,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:58,712 INFO L453 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-03-04 16:55:58,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:58,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:58,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:58,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:58,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:58,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:58,730 INFO L453 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 27 [2019-03-04 16:55:58,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:58,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:58,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:58,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:58,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:58,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:58,784 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:55:58,785 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,824 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,832 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,841 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,852 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,884 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:55:58,885 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,891 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,899 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,909 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,931 INFO L309 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-03-04 16:55:58,931 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-03-04 16:55:58,976 INFO L453 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 31 treesize of output 26 [2019-03-04 16:55:58,977 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,994 INFO L309 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-03-04 16:55:58,994 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:55:59,028 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:55:59,028 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:59,042 INFO L309 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-03-04 16:55:59,042 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:33 [2019-03-04 16:55:59,088 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 40 [2019-03-04 16:55:59,089 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:59,100 INFO L309 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-03-04 16:55:59,100 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-03-04 16:55:59,177 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 35 treesize of output 47 [2019-03-04 16:55:59,178 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:59,189 INFO L309 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-03-04 16:55:59,190 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-03-04 16:55:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:59,206 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:59,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:59,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-03-04 16:55:59,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:59,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:55:59,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:55:59,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:55:59,277 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-03-04 16:56:02,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:02,598 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-03-04 16:56:02,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:56:02,598 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:56:02,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:02,605 INFO L225 Difference]: With dead ends: 1108 [2019-03-04 16:56:02,605 INFO L226 Difference]: Without dead ends: 1107 [2019-03-04 16:56:02,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:56:02,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-03-04 16:56:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-03-04 16:56:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-03-04 16:56:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-03-04 16:56:05,427 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-03-04 16:56:05,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:05,427 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-03-04 16:56:05,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:56:05,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-03-04 16:56:05,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:56:05,429 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:05,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:56:05,429 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:05,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:05,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-03-04 16:56:05,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:05,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:05,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:05,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:05,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:56:05,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:05,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:05,507 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:56:05,507 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-03-04 16:56:05,508 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:56:05,509 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:56:05,948 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:56:05,948 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-03-04 16:56:05,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:05,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:56:05,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:05,949 INFO 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-03-04 16:56:05,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:05,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:05,962 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:56:05,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:05,969 INFO L453 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-03-04 16:56:05,991 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:56:06,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:06,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:06,010 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:56:06,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:06,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:06,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:06,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:06,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:06,026 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:56:06,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:06,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:06,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:06,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:06,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:06,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:06,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:06,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:06,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:06,043 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:56:06,043 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:06,055 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:06,066 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:06,205 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:06,284 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:06,322 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:56:06,322 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:06,327 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:06,337 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:06,353 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:06,381 INFO L309 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-03-04 16:56:06,382 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:56:06,407 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:56:06,407 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:06,432 INFO L309 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-03-04 16:56:06,432 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:56:06,475 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:56:06,476 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:56:06,518 INFO L309 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-03-04 16:56:06,519 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:80 [2019-03-04 16:56:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:06,764 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:06,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:06,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:56:06,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:06,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:56:06,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:56:06,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:56:06,805 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-03-04 16:56:09,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:09,785 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-03-04 16:56:09,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:56:09,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:56:09,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:09,792 INFO L225 Difference]: With dead ends: 1075 [2019-03-04 16:56:09,792 INFO L226 Difference]: Without dead ends: 1074 [2019-03-04 16:56:09,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:56:09,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-03-04 16:56:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-03-04 16:56:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-03-04 16:56:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-03-04 16:56:12,572 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-03-04 16:56:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:12,572 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-03-04 16:56:12,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:56:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-03-04 16:56:12,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:56:12,574 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:12,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:56:12,574 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:12,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:12,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-03-04 16:56:12,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:12,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:12,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:12,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:12,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:56:12,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:12,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:12,741 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:56:12,741 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-03-04 16:56:12,742 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:56:12,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:56:13,363 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:56:13,363 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-03-04 16:56:13,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:13,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:56:13,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:13,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 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-03-04 16:56:13,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:13,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:13,377 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:56:13,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:13,383 INFO L453 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-03-04 16:56:13,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,389 INFO L453 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 23 [2019-03-04 16:56:13,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,399 INFO L453 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-03-04 16:56:13,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,417 INFO L453 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 27 [2019-03-04 16:56:13,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,429 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:13,443 INFO L453 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 26 [2019-03-04 16:56:13,443 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:13,456 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:13,469 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:13,480 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:13,492 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:13,533 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:56:13,534 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:13,538 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:13,549 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:13,562 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:13,580 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:13,611 INFO L309 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-03-04 16:56:13,611 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:56:13,641 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:56:13,642 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:13,671 INFO L309 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-03-04 16:56:13,671 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 16:56:13,711 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:56:13,711 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:13,733 INFO L309 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-03-04 16:56:13,733 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-03-04 16:56:13,879 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:56:13,880 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:13,898 INFO L309 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-03-04 16:56:13,898 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:36 [2019-03-04 16:56:13,964 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 54 [2019-03-04 16:56:13,964 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:13,982 INFO L309 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-03-04 16:56:13,982 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-03-04 16:56:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:14,007 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:14,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:14,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:56:14,077 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:14,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:56:14,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:56:14,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:56:14,078 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-03-04 16:56:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:18,587 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-03-04 16:56:18,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:56:18,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:56:18,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:18,595 INFO L225 Difference]: With dead ends: 1522 [2019-03-04 16:56:18,595 INFO L226 Difference]: Without dead ends: 1521 [2019-03-04 16:56:18,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:56:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-03-04 16:56:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-03-04 16:56:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-03-04 16:56:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-03-04 16:56:21,598 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-03-04 16:56:21,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:21,599 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-03-04 16:56:21,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:56:21,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-03-04 16:56:21,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:56:21,601 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:21,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:56:21,601 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:21,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:21,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-03-04 16:56:21,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:21,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:21,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:21,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:21,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:21,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:21,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:21,633 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:56:21,633 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-03-04 16:56:21,634 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:56:21,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:56:22,732 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:56:22,732 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-03-04 16:56:22,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:22,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:56:22,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:22,733 INFO 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-03-04 16:56:22,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:22,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:22,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2019-03-04 16:56:22,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:22,781 INFO L453 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-03-04 16:56:22,795 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:56:22,818 INFO L453 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:56:22,859 INFO L453 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-03-04 16:56:22,911 INFO L453 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 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:56:22,911 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,923 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,935 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,947 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,959 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,971 INFO L309 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-03-04 16:56:22,971 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-03-04 16:56:22,979 INFO L453 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 16 treesize of output 11 [2019-03-04 16:56:22,979 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,981 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,981 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-03-04 16:56:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:22,985 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:23,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:56:23,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:56:23,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:56:23,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:56:23,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:56:23,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:56:23,028 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-03-04 16:56:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:26,972 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-03-04 16:56:26,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:56:26,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-03-04 16:56:26,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:26,980 INFO L225 Difference]: With dead ends: 1559 [2019-03-04 16:56:26,981 INFO L226 Difference]: Without dead ends: 1554 [2019-03-04 16:56:26,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:56:26,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-03-04 16:56:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-03-04 16:56:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-03-04 16:56:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-03-04 16:56:31,196 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-03-04 16:56:31,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:31,196 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-03-04 16:56:31,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:56:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-03-04 16:56:31,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:56:31,199 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:31,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:56:31,199 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:31,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:31,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-03-04 16:56:31,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:31,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:31,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:31,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:31,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:31,349 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-03-04 16:56:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:56:31,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:31,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:31,698 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:56:31,698 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-03-04 16:56:31,701 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:56:31,702 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:56:32,679 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:56:32,680 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-03-04 16:56:32,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:32,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:56:32,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:32,680 INFO 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-03-04 16:56:32,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:32,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:32,695 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:56:32,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:32,700 INFO L453 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-03-04 16:56:32,728 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:56:32,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:32,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:32,742 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:56:32,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:32,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:32,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:32,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:32,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:32,762 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:56:32,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:32,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:32,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:32,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:32,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:32,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:32,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:32,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:32,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:32,780 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:56:32,780 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:32,790 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:32,801 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:32,811 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:32,821 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:32,858 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:56:32,859 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:32,865 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:32,877 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:32,894 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:32,922 INFO L309 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-03-04 16:56:32,922 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:56:32,963 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:56:32,963 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:33,000 INFO L309 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-03-04 16:56:33,001 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:56:33,077 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:56:33,078 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:56:33,144 INFO L309 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-03-04 16:56:33,144 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-03-04 16:56:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:33,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:33,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:33,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:56:33,233 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:33,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:56:33,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:56:33,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:56:33,234 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-03-04 16:56:37,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:37,535 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-03-04 16:56:37,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:56:37,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:56:37,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:37,542 INFO L225 Difference]: With dead ends: 1574 [2019-03-04 16:56:37,542 INFO L226 Difference]: Without dead ends: 1570 [2019-03-04 16:56:37,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:56:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-03-04 16:56:41,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-03-04 16:56:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-03-04 16:56:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-03-04 16:56:41,812 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-03-04 16:56:41,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:41,812 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-03-04 16:56:41,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:56:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-03-04 16:56:41,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:56:41,814 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:41,814 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:56:41,814 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:41,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:41,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-03-04 16:56:41,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:41,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:41,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:41,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:41,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:56:41,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:41,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:41,881 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:41,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:41,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:41,882 INFO 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-03-04 16:56:41,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:56:41,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:56:41,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:56:41,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:41,908 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:56:41,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:41,913 INFO L453 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-03-04 16:56:41,930 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:56:41,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,941 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:56:41,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,954 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:56:41,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,971 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:56:41,971 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:41,983 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:41,994 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,003 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,015 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,052 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:56:42,052 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,059 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,071 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,087 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,116 INFO L309 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-03-04 16:56:42,116 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:56:42,143 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:56:42,144 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,170 INFO L309 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-03-04 16:56:42,171 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-03-04 16:56:42,217 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:56:42,218 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:56:42,258 INFO L309 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-03-04 16:56:42,258 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:76 [2019-03-04 16:56:42,315 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:56:42,316 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,327 INFO L309 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-03-04 16:56:42,328 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-03-04 16:56:42,365 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 34 [2019-03-04 16:56:42,366 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,375 INFO L309 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-03-04 16:56:42,376 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-03-04 16:56:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:42,393 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:42,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:42,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:56:42,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:42,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:56:42,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:56:42,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:56:42,463 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-03-04 16:56:48,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:48,390 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-03-04 16:56:48,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:56:48,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:56:48,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:48,396 INFO L225 Difference]: With dead ends: 2098 [2019-03-04 16:56:48,396 INFO L226 Difference]: Without dead ends: 2091 [2019-03-04 16:56:48,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:56:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-03-04 16:56:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-03-04 16:56:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-03-04 16:56:53,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-03-04 16:56:53,502 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-03-04 16:56:53,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:53,502 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-03-04 16:56:53,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:56:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-03-04 16:56:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:56:53,505 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:53,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:56:53,505 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:53,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:53,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-03-04 16:56:53,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:53,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:53,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:53,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:53,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:53,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:53,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:53,562 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:56:53,563 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-03-04 16:56:53,564 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:56:53,564 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:56:53,997 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:56:53,997 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-03-04 16:56:53,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:53,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:56:53,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:53,998 INFO 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-03-04 16:56:54,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:54,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:54,011 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:56:54,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:54,018 INFO L453 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-03-04 16:56:54,039 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:56:54,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,050 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:56:54,053 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,065 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:56:54,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,089 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:56:54,090 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,099 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,110 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,120 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,131 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,168 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:56:54,169 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,173 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,183 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,199 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,227 INFO L309 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-03-04 16:56:54,227 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:56:54,264 INFO L453 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 31 treesize of output 26 [2019-03-04 16:56:54,264 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,282 INFO L309 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-03-04 16:56:54,283 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:56:54,315 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:56:54,315 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,329 INFO L309 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-03-04 16:56:54,329 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-03-04 16:56:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:54,370 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:54,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:54,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:56:54,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:54,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:56:54,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:56:54,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:56:54,411 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-03-04 16:56:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:59,405 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-03-04 16:56:59,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:56:59,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:56:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:59,410 INFO L225 Difference]: With dead ends: 1846 [2019-03-04 16:56:59,411 INFO L226 Difference]: Without dead ends: 1839 [2019-03-04 16:56:59,411 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-03-04 16:56:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-03-04 16:57:04,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-03-04 16:57:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-03-04 16:57:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-03-04 16:57:04,464 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-03-04 16:57:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:04,465 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-03-04 16:57:04,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:57:04,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-03-04 16:57:04,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:57:04,467 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:04,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:57:04,467 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:04,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:04,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-03-04 16:57:04,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:04,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:04,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:04,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:04,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:04,871 WARN L181 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-03-04 16:57:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:57:04,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:04,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:04,956 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:57:04,956 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-03-04 16:57:04,957 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:57:04,957 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:57:05,197 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:57:05,197 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-03-04 16:57:05,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:05,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:57:05,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:05,198 INFO 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-03-04 16:57:05,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:05,207 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:05,211 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:57:05,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:05,216 INFO L453 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-03-04 16:57:05,242 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:57:05,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:05,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:05,252 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:57:05,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:05,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:05,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:05,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:05,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:05,273 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:57:05,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:05,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:05,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:05,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:05,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:05,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:05,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:05,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:05,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:05,290 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:57:05,291 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:05,302 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:05,313 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:05,324 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:05,335 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:05,372 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:57:05,373 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:05,389 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:05,399 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:05,415 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:05,444 INFO L309 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-03-04 16:57:05,444 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:57:05,486 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:57:05,486 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:57:05,528 INFO L309 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-03-04 16:57:05,529 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:96 [2019-03-04 16:57:05,631 INFO L453 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 45 [2019-03-04 16:57:05,632 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:05,698 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 62 [2019-03-04 16:57:05,699 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:05,734 INFO L309 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-03-04 16:57:05,735 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-03-04 16:57:05,816 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 53 [2019-03-04 16:57:05,817 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:05,886 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 16:57:05,887 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:05,920 INFO L309 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-03-04 16:57:05,921 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:74 [2019-03-04 16:57:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:05,979 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:06,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:06,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-03-04 16:57:06,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:06,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:57:06,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:57:06,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:57:06,039 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-03-04 16:57:06,242 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-03-04 16:57:08,047 WARN L181 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-03-04 16:57:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:12,988 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-03-04 16:57:12,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:57:12,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:57:12,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:12,994 INFO L225 Difference]: With dead ends: 2193 [2019-03-04 16:57:12,995 INFO L226 Difference]: Without dead ends: 2192 [2019-03-04 16:57:12,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:57:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-03-04 16:57:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-03-04 16:57:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-03-04 16:57:18,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-03-04 16:57:18,416 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-03-04 16:57:18,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:18,416 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-03-04 16:57:18,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:57:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-03-04 16:57:18,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:57:18,420 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:18,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:57:18,420 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:18,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:18,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-03-04 16:57:18,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:18,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:18,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:18,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:18,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:18,563 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:57:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:18,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:18,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:18,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:18,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:18,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:18,850 INFO 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-03-04 16:57:18,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:57:18,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:57:18,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:57:18,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:18,896 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:57:18,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:18,924 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:57:18,924 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:18,932 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:18,943 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:18,961 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:18,983 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,010 INFO L453 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-03-04 16:57:19,013 INFO L453 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 23 [2019-03-04 16:57:19,017 INFO L453 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 25 [2019-03-04 16:57:19,022 INFO L453 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 27 [2019-03-04 16:57:19,028 INFO L453 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 26 [2019-03-04 16:57:19,028 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,047 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,067 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,088 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,105 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,147 INFO L309 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-03-04 16:57:19,147 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:57:19,202 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:57:19,202 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,243 INFO L309 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-03-04 16:57:19,244 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 16:57:19,291 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:57:19,291 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,312 INFO L309 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-03-04 16:57:19,313 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:40 [2019-03-04 16:57:19,361 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:57:19,362 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,379 INFO L309 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-03-04 16:57:19,379 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-03-04 16:57:19,439 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 50 [2019-03-04 16:57:19,440 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,455 INFO L309 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-03-04 16:57:19,456 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-03-04 16:57:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:19,476 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:19,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:19,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:57:19,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:19,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:57:19,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:57:19,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:57:19,545 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-03-04 16:57:26,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:26,697 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-03-04 16:57:26,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:57:26,698 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:57:26,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:26,704 INFO L225 Difference]: With dead ends: 2526 [2019-03-04 16:57:26,704 INFO L226 Difference]: Without dead ends: 2520 [2019-03-04 16:57:26,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:57:26,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-03-04 16:57:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-03-04 16:57:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-03-04 16:57:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-03-04 16:57:32,303 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-03-04 16:57:32,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:32,304 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-03-04 16:57:32,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:57:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-03-04 16:57:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:57:32,308 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:32,308 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:57:32,308 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:32,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:32,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-03-04 16:57:32,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:32,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:32,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:57:32,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:32,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:57:32,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:32,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:32,402 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:57:32,402 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-03-04 16:57:32,403 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:57:32,403 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:57:32,590 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:57:32,590 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-03-04 16:57:32,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:32,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:57:32,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:32,591 INFO 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-03-04 16:57:32,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:32,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:32,607 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:57:32,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:32,613 INFO L453 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-03-04 16:57:32,638 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:57:32,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,647 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:57:32,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,665 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:57:32,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,686 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:57:32,687 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:32,698 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:32,709 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:32,720 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:32,729 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:32,766 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:57:32,767 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:32,772 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:32,781 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:32,797 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:32,826 INFO L309 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-03-04 16:57:32,827 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:57:32,862 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:57:32,863 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:57:32,904 INFO L309 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-03-04 16:57:32,905 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-03-04 16:57:32,944 INFO L453 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 31 treesize of output 26 [2019-03-04 16:57:32,944 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:32,962 INFO L309 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-03-04 16:57:32,962 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-03-04 16:57:32,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:32,979 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:33,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:33,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-03-04 16:57:33,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:33,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:57:33,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:57:33,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:57:33,025 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-03-04 16:57:38,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:38,543 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-03-04 16:57:38,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:57:38,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-03-04 16:57:38,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:38,549 INFO L225 Difference]: With dead ends: 1971 [2019-03-04 16:57:38,549 INFO L226 Difference]: Without dead ends: 1964 [2019-03-04 16:57:38,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:57:38,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-03-04 16:57:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-03-04 16:57:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-03-04 16:57:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-03-04 16:57:44,134 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-03-04 16:57:44,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:44,134 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-03-04 16:57:44,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:57:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-03-04 16:57:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:57:44,138 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:44,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:57:44,138 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:44,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:44,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-03-04 16:57:44,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:44,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:44,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:44,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:44,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:57:44,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:44,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:44,239 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:44,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:44,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:44,240 INFO 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-03-04 16:57:44,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:57:44,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:57:44,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:57:44,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:44,257 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:57:44,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:44,265 INFO L453 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-03-04 16:57:44,277 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:57:44,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:44,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:44,297 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:57:44,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:44,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:44,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:44,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:44,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:44,308 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:57:44,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:44,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:44,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:44,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:44,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:44,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:44,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:44,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:44,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:44,325 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:57:44,325 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:44,335 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:44,346 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:44,358 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:44,369 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:44,405 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:57:44,406 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:44,412 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:44,425 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:44,441 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:44,469 INFO L309 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-03-04 16:57:44,469 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:57:44,515 INFO L453 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 31 treesize of output 26 [2019-03-04 16:57:44,516 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:44,533 INFO L309 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-03-04 16:57:44,534 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:57:44,569 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:57:44,570 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:44,582 INFO L309 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-03-04 16:57:44,583 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:57:44,646 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:57:44,646 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:44,662 INFO L309 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-03-04 16:57:44,663 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:57:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:44,693 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:44,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:44,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:57:44,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:44,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:57:44,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:57:44,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:57:44,764 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-03-04 16:57:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:50,660 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-03-04 16:57:50,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:57:50,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-03-04 16:57:50,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:50,666 INFO L225 Difference]: With dead ends: 2036 [2019-03-04 16:57:50,666 INFO L226 Difference]: Without dead ends: 2033 [2019-03-04 16:57:50,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:57:50,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-03-04 16:57:56,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-03-04 16:57:56,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-03-04 16:57:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-03-04 16:57:56,356 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-03-04 16:57:56,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:56,356 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-03-04 16:57:56,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:57:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-03-04 16:57:56,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:57:56,359 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:56,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:57:56,360 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:56,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:56,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-03-04 16:57:56,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:56,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:56,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:57:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:56,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:57:56,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:56,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:56,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:56,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:56,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:56,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 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-03-04 16:57:56,437 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:57:56,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:57:56,441 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:57:56,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:56,442 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:57:56,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:56,467 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:57:56,468 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:56,478 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:56,492 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:56,507 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:56,526 INFO L453 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-03-04 16:57:56,529 INFO L453 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 23 [2019-03-04 16:57:56,532 INFO L453 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 25 [2019-03-04 16:57:56,534 INFO L453 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 27 [2019-03-04 16:57:56,566 INFO L453 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:57:56,567 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:56,575 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:56,585 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:56,595 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:56,604 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:56,626 INFO L309 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-03-04 16:57:56,626 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-03-04 16:57:56,662 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:57:56,663 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:57:56,702 INFO L309 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-03-04 16:57:56,702 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:79 [2019-03-04 16:57:56,792 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 73 [2019-03-04 16:57:56,795 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-03-04 16:57:56,954 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:57:56,955 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:57,046 INFO L309 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-03-04 16:57:57,046 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-03-04 16:57:57,168 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-03-04 16:57:57,176 INFO L453 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 55 treesize of output 50 [2019-03-04 16:57:57,177 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:57,281 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 45 [2019-03-04 16:57:57,282 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:57,371 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:57:57,371 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:57,460 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:57:57,461 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:57,512 INFO L309 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-03-04 16:57:57,512 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-03-04 16:57:57,624 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 49 [2019-03-04 16:57:57,625 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:57,725 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 46 [2019-03-04 16:57:57,726 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:57,809 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:57:57,810 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:57,899 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 46 [2019-03-04 16:57:57,899 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:57,952 INFO L309 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-03-04 16:57:57,952 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-03-04 16:57:58,076 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-03-04 16:57:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:58,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:58,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:58,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:57:58,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:58,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:57:58,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:57:58,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:57:58,221 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-03-04 16:58:00,246 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-03-04 16:58:07,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:07,484 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-03-04 16:58:07,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:58:07,485 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:58:07,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:07,492 INFO L225 Difference]: With dead ends: 2952 [2019-03-04 16:58:07,492 INFO L226 Difference]: Without dead ends: 2951 [2019-03-04 16:58:07,493 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-03-04 16:58:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-03-04 16:58:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-03-04 16:58:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-03-04 16:58:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-03-04 16:58:12,636 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-03-04 16:58:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:12,637 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-03-04 16:58:12,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:58:12,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-03-04 16:58:12,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:58:12,639 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:12,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:58:12,639 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:12,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:12,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-03-04 16:58:12,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:12,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:12,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:58:12,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:12,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:12,809 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-03-04 16:58:12,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:58:12,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:12,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:12,898 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:58:12,899 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-03-04 16:58:12,899 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:58:12,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:58:13,086 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:58:13,087 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-03-04 16:58:13,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:13,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:58:13,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:13,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 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-03-04 16:58:13,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:13,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:58:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:13,102 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:58:13,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:13,128 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:58:13,128 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:13,138 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:13,156 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:13,178 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:13,201 INFO L453 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-03-04 16:58:13,213 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:58:13,217 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:58:13,222 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:58:13,226 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:58:13,227 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:13,237 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:13,247 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:13,257 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:13,267 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:13,295 INFO L309 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-03-04 16:58:13,296 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:58:13,328 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:58:13,329 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:58:13,373 INFO L309 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-03-04 16:58:13,374 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:100 [2019-03-04 16:58:13,455 INFO L453 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:58:13,456 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:13,519 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 60 [2019-03-04 16:58:13,520 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:13,563 INFO L309 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-03-04 16:58:13,564 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:116, output treesize:86 [2019-03-04 16:58:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:15,174 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:15,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:15,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-03-04 16:58:15,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:15,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:58:15,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:58:15,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:58:15,257 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-03-04 16:58:15,572 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-03-04 16:58:16,002 WARN L181 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-03-04 16:58:22,716 WARN L181 SmtUtils]: Spent 6.68 s on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-03-04 16:58:28,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:28,379 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-03-04 16:58:28,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:58:28,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:58:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:28,385 INFO L225 Difference]: With dead ends: 1903 [2019-03-04 16:58:28,385 INFO L226 Difference]: Without dead ends: 1896 [2019-03-04 16:58:28,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:58:28,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-03-04 16:58:34,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-03-04 16:58:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-03-04 16:58:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-03-04 16:58:34,139 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-03-04 16:58:34,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:34,139 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-03-04 16:58:34,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:58:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-03-04 16:58:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:58:34,142 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:34,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:58:34,142 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:34,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:34,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-03-04 16:58:34,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:34,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:34,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:34,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:34,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:58:34,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:34,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:34,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:34,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:34,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:34,210 INFO 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-03-04 16:58:34,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:58:34,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:58:34,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:58:34,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:58:34,228 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:58:34,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:34,233 INFO L453 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-03-04 16:58:34,250 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:58:34,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:58:34,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:58:34,269 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:58:34,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:58:34,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:58:34,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:58:34,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:58:34,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:58:34,305 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:58:34,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:58:34,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:58:34,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:58:34,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:58:34,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:58:34,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:58:34,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:58:34,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:58:34,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:58:34,327 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:58:34,328 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:34,339 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:34,350 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:34,361 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:34,372 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:34,407 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:58:34,408 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:34,414 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:34,423 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:34,440 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:34,468 INFO L309 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-03-04 16:58:34,469 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:58:34,495 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:58:34,496 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:34,523 INFO L309 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-03-04 16:58:34,524 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:58:34,568 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:58:34,569 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:58:34,612 INFO L309 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-03-04 16:58:34,612 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:80 [2019-03-04 16:58:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:34,644 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:34,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:34,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:58:34,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:34,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:58:34,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:58:34,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:58:34,687 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-03-04 16:58:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:40,317 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-03-04 16:58:40,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:58:40,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:58:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:40,323 INFO L225 Difference]: With dead ends: 1884 [2019-03-04 16:58:40,323 INFO L226 Difference]: Without dead ends: 1877 [2019-03-04 16:58:40,324 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-03-04 16:58:40,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-03-04 16:58:46,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-03-04 16:58:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-03-04 16:58:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-03-04 16:58:46,099 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-03-04 16:58:46,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:46,099 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-03-04 16:58:46,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:58:46,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-03-04 16:58:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:58:46,102 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:46,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:58:46,102 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:46,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:46,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-03-04 16:58:46,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:46,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:46,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:58:46,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:46,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:46,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:46,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:46,232 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:58:46,233 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-03-04 16:58:46,233 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:58:46,233 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:58:46,495 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:58:46,495 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-03-04 16:58:46,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:46,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:58:46,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:46,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-03-04 16:58:46,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:46,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:58:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:46,509 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:58:46,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:46,543 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:58:46,544 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:46,561 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:46,577 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:46,597 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:46,622 INFO L453 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-03-04 16:58:46,637 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:58:46,641 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:58:46,647 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:58:46,653 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:58:46,653 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:46,662 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:46,672 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:46,682 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:46,692 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:46,720 INFO L309 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-03-04 16:58:46,720 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:58:46,747 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:58:46,747 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:46,774 INFO L309 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-03-04 16:58:46,775 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:48 [2019-03-04 16:58:46,810 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:58:46,810 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:46,831 INFO L309 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-03-04 16:58:46,831 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-03-04 16:58:46,884 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 50 [2019-03-04 16:58:46,885 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:58:46,920 INFO L309 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-03-04 16:58:46,921 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:68 [2019-03-04 16:58:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:46,952 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:46,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:46,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-03-04 16:58:46,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:46,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:58:46,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:58:47,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:58:47,000 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-03-04 16:58:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:55,922 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-03-04 16:58:55,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:58:55,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 16:58:55,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:55,930 INFO L225 Difference]: With dead ends: 2991 [2019-03-04 16:58:55,930 INFO L226 Difference]: Without dead ends: 2978 [2019-03-04 16:58:55,931 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-03-04 16:58:55,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-03-04 16:59:03,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-03-04 16:59:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-03-04 16:59:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-03-04 16:59:03,584 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-03-04 16:59:03,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:03,584 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-03-04 16:59:03,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:59:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-03-04 16:59:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:59:03,588 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:03,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:59:03,588 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:03,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:03,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-03-04 16:59:03,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:03,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:03,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:03,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:03,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:59:03,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:03,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:03,688 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:59:03,688 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-03-04 16:59:03,689 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:59:03,689 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:59:04,064 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:59:04,064 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-03-04 16:59:04,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:04,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:59:04,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:04,065 INFO 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-03-04 16:59:04,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:04,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:59:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:04,098 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:59:04,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:04,174 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:59:04,175 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:04,182 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:04,195 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:04,205 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:04,224 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:04,249 INFO L453 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-03-04 16:59:04,252 INFO L453 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 23 [2019-03-04 16:59:04,255 INFO L453 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 25 [2019-03-04 16:59:04,275 INFO L453 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 27 [2019-03-04 16:59:04,293 INFO L453 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 26 [2019-03-04 16:59:04,293 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:04,301 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:04,311 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:04,321 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:04,331 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:04,361 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:04,362 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-03-04 16:59:04,398 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:59:04,398 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:04,429 INFO L309 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-03-04 16:59:04,430 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2019-03-04 16:59:04,474 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:59:04,474 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:04,494 INFO L309 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-03-04 16:59:04,495 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 16:59:04,548 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:59:04,548 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:04,566 INFO L309 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-03-04 16:59:04,566 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-03-04 16:59:04,632 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 50 [2019-03-04 16:59:04,633 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:04,648 INFO L309 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-03-04 16:59:04,648 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:38 [2019-03-04 16:59:04,724 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 40 treesize of output 59 [2019-03-04 16:59:04,725 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:04,742 INFO L309 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-03-04 16:59:04,742 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-03-04 16:59:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:04,770 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:05,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:05,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-03-04 16:59:05,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:05,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:59:05,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:59:05,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:59:05,435 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-03-04 16:59:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:15,554 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-03-04 16:59:15,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:59:15,555 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-03-04 16:59:15,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:15,564 INFO L225 Difference]: With dead ends: 3181 [2019-03-04 16:59:15,564 INFO L226 Difference]: Without dead ends: 3179 [2019-03-04 16:59:15,565 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-03-04 16:59:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-03-04 16:59:23,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-03-04 16:59:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-03-04 16:59:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-03-04 16:59:23,079 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-03-04 16:59:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:23,080 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-03-04 16:59:23,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:59:23,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-03-04 16:59:23,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:59:23,083 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:23,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:59:23,083 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:23,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:23,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-03-04 16:59:23,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:23,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:23,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:23,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:23,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:59:23,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:59:23,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:59:23,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:59:23,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:59:23,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:59:23,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:59:23,163 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-03-04 16:59:30,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:30,177 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-03-04 16:59:30,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:59:30,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-03-04 16:59:30,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:30,184 INFO L225 Difference]: With dead ends: 2346 [2019-03-04 16:59:30,184 INFO L226 Difference]: Without dead ends: 2337 [2019-03-04 16:59:30,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:59:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-03-04 16:59:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-03-04 16:59:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-03-04 16:59:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-03-04 16:59:37,897 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-03-04 16:59:37,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:37,898 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-03-04 16:59:37,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:59:37,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-03-04 16:59:37,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:59:37,901 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:37,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:59:37,901 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:37,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:37,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-03-04 16:59:37,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:37,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:37,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:37,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:37,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:59:38,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:38,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:38,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:38,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:38,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:38,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:59:38,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:59:38,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:59:38,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:59:38,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:59:38,049 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:59:38,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:38,103 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:59:38,103 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:38,106 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:38,112 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:38,122 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:38,141 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:38,167 INFO L453 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-03-04 16:59:38,177 INFO L453 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 23 [2019-03-04 16:59:38,180 INFO L453 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 25 [2019-03-04 16:59:38,183 INFO L453 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 27 [2019-03-04 16:59:38,186 INFO L453 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 26 [2019-03-04 16:59:38,187 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:38,197 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:38,207 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:38,217 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:38,227 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:38,257 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:38,258 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-03-04 16:59:38,296 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:59:38,296 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:38,325 INFO L309 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-03-04 16:59:38,326 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2019-03-04 16:59:38,369 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:59:38,370 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:38,392 INFO L309 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-03-04 16:59:38,392 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 16:59:38,446 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:59:38,446 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:38,462 INFO L309 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-03-04 16:59:38,462 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-03-04 16:59:38,528 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 40 treesize of output 52 [2019-03-04 16:59:38,529 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:38,546 INFO L309 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-03-04 16:59:38,546 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:59:38,622 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 40 treesize of output 59 [2019-03-04 16:59:38,623 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:38,641 INFO L309 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-03-04 16:59:38,641 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-03-04 16:59:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:38,672 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:38,764 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:38,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:38,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-03-04 16:59:38,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:38,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:59:38,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:59:38,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:59:38,783 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-03-04 16:59:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:46,842 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-03-04 16:59:46,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:59:46,843 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-03-04 16:59:46,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:46,849 INFO L225 Difference]: With dead ends: 2345 [2019-03-04 16:59:46,849 INFO L226 Difference]: Without dead ends: 2338 [2019-03-04 16:59:46,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-03-04 16:59:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-03-04 16:59:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-03-04 16:59:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-03-04 16:59:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-03-04 16:59:48,954 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-03-04 16:59:48,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:48,954 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-03-04 16:59:48,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:59:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-03-04 16:59:48,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:59:48,955 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:48,955 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-03-04 16:59:48,955 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:48,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:48,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-03-04 16:59:48,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:48,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:48,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:59:48,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:48,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:59:49,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:49,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:49,028 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:59:49,028 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-03-04 16:59:49,029 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:59:49,030 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:59:49,322 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:59:49,322 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-03-04 16:59:49,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:49,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:59:49,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:49,323 INFO 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-03-04 16:59:49,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:49,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:59:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:49,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:59:49,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:49,378 INFO L453 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-03-04 16:59:49,566 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:59:49,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:49,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:49,672 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:59:49,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:49,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:49,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:49,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:49,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:49,783 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:59:49,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:49,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:49,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:49,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:49,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:49,823 INFO L453 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:59:49,824 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:49,835 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:49,846 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:49,855 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:49,866 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:49,893 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:59:49,893 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:49,898 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:49,907 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:49,926 INFO L309 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-03-04 16:59:49,927 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-03-04 16:59:49,957 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:59:49,957 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:49,967 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:49,967 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:22 [2019-03-04 16:59:49,996 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 26 [2019-03-04 16:59:49,997 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:50,004 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:50,004 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-03-04 16:59:50,034 INFO L453 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 33 [2019-03-04 16:59:50,034 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:50,041 INFO L309 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-03-04 16:59:50,041 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-03-04 16:59:50,073 INFO L453 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 33 [2019-03-04 16:59:50,074 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:50,080 INFO L309 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-03-04 16:59:50,081 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2019-03-04 16:59:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:50,096 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:50,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:50,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-03-04 16:59:50,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:50,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:59:50,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:59:50,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:59:50,158 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-03-04 16:59:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:52,463 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-03-04 16:59:52,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:59:52,464 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 16:59:52,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:52,466 INFO L225 Difference]: With dead ends: 480 [2019-03-04 16:59:52,466 INFO L226 Difference]: Without dead ends: 477 [2019-03-04 16:59:52,466 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-03-04 16:59:52,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-03-04 16:59:53,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-03-04 16:59:53,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-03-04 16:59:53,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-03-04 16:59:53,388 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-03-04 16:59:53,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:53,388 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-03-04 16:59:53,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:59:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-03-04 16:59:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:59:53,389 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:53,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:59:53,389 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:53,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:53,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-03-04 16:59:53,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:53,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:53,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:53,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:53,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:59:53,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:53,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:53,479 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:59:53,479 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-03-04 16:59:53,480 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:59:53,480 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:59:53,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:59:53,741 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-03-04 16:59:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:53,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:59:53,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:53,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 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-03-04 16:59:53,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:53,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:59:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:53,760 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:59:53,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:53,766 INFO L453 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-03-04 16:59:53,793 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:59:53,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:53,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:53,803 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:59:53,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:53,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:53,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:53,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:53,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:53,821 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:59:53,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:53,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:53,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:53,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:53,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:53,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:53,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:53,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:53,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:53,838 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:59:53,838 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:53,847 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:53,856 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:53,866 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:53,876 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:53,911 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:59:53,911 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:53,916 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:53,927 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:53,943 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:53,971 INFO L309 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-03-04 16:59:53,972 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:59:54,009 INFO L453 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 31 treesize of output 26 [2019-03-04 16:59:54,010 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:54,043 INFO L309 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-03-04 16:59:54,043 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:59:54,071 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:59:54,072 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:54,085 INFO L309 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-03-04 16:59:54,085 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:59:54,121 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:59:54,122 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:54,132 INFO L309 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-03-04 16:59:54,132 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:59:54,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:54,154 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:54,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:54,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:59:54,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:54,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:59:54,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:59:54,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:59:54,202 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-03-04 16:59:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:56,037 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-03-04 16:59:56,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:59:56,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:59:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:56,038 INFO L225 Difference]: With dead ends: 250 [2019-03-04 16:59:56,039 INFO L226 Difference]: Without dead ends: 243 [2019-03-04 16:59:56,039 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-03-04 16:59:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-03-04 16:59:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-03-04 16:59:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-03-04 16:59:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-03-04 16:59:57,501 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-03-04 16:59:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:57,502 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-03-04 16:59:57,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:59:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-03-04 16:59:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:59:57,502 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:57,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:59:57,502 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:57,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:57,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-03-04 16:59:57,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:57,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:57,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:57,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:57,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:59:57,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:57,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:57,607 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:59:57,607 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-03-04 16:59:57,608 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:59:57,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:59:57,860 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:59:57,860 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-03-04 16:59:57,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:57,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:59:57,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:57,861 INFO 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-03-04 16:59:57,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:57,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:59:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:57,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:59:57,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:57,908 INFO L453 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-03-04 16:59:57,921 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:59:57,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:57,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:57,933 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:59:57,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:57,943 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:57,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:57,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:57,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:57,951 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:59:57,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:57,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:57,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:57,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:57,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:59:58,015 INFO L453 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:59:58,015 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:58,026 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:58,036 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:58,048 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:58,057 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:58,085 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:59:58,085 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:58,090 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:58,100 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:58,120 INFO L309 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-03-04 16:59:58,120 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-03-04 16:59:58,154 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:59:58,154 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:58,165 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:58,165 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:22 [2019-03-04 16:59:58,191 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:59:58,192 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:58,201 INFO L309 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-03-04 16:59:58,201 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-03-04 16:59:58,238 INFO L453 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 37 [2019-03-04 16:59:58,238 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:58,248 INFO L309 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-03-04 16:59:58,248 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-03-04 16:59:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:58,263 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:58,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:58,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:59:58,313 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:58,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:59:58,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:59:58,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:59:58,314 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-03-04 17:00:01,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:01,458 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-03-04 17:00:01,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 17:00:01,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 17:00:01,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:01,459 INFO L225 Difference]: With dead ends: 372 [2019-03-04 17:00:01,459 INFO L226 Difference]: Without dead ends: 362 [2019-03-04 17:00:01,460 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-03-04 17:00:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-03-04 17:00:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-03-04 17:00:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-03-04 17:00:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-03-04 17:00:03,802 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-03-04 17:00:03,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:03,802 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-03-04 17:00:03,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 17:00:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-03-04 17:00:03,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 17:00:03,803 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:03,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:00:03,803 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:03,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:03,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-03-04 17:00:03,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:03,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:03,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:03,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:03,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:03,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:03,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:03,971 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:03,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:03,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:03,971 INFO 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-03-04 17:00:03,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:00:03,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:00:04,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 17:00:04,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:00:04,025 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 17:00:04,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:04,052 INFO L453 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-03-04 17:00:04,111 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:00:04,120 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:04,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:04,122 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:00:04,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:04,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:04,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:04,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:04,132 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:04,134 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 17:00:04,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:04,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:04,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:04,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:04,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:04,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:04,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:04,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:04,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:04,151 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:00:04,152 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:04,163 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:04,174 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:04,185 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:04,196 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:04,233 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 17:00:04,234 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:04,240 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:04,249 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:04,266 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:04,294 INFO L309 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-03-04 17:00:04,294 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 17:00:04,318 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 17:00:04,319 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:04,345 INFO L309 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-03-04 17:00:04,346 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 17:00:04,389 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 17:00:04,390 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 17:00:04,433 INFO L309 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-03-04 17:00:04,433 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:80 [2019-03-04 17:00:04,488 INFO L453 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 17:00:04,488 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:04,505 INFO L309 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-03-04 17:00:04,506 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:27 [2019-03-04 17:00:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:04,523 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:04,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:04,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 17:00:04,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:04,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 17:00:04,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 17:00:04,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 17:00:04,593 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-03-04 17:00:07,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:07,450 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-03-04 17:00:07,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 17:00:07,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 17:00:07,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:07,452 INFO L225 Difference]: With dead ends: 332 [2019-03-04 17:00:07,452 INFO L226 Difference]: Without dead ends: 325 [2019-03-04 17:00:07,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-03-04 17:00:07,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-03-04 17:00:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-03-04 17:00:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-03-04 17:00:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-03-04 17:00:09,805 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-03-04 17:00:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:09,805 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-03-04 17:00:09,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 17:00:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-03-04 17:00:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 17:00:09,806 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:09,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:00:09,806 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:09,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:09,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-03-04 17:00:09,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:09,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:09,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:00:09,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:09,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 17:00:09,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:09,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:09,951 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 17:00:09,952 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-03-04 17:00:09,953 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 17:00:09,953 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 17:00:10,483 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 17:00:10,484 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-03-04 17:00:10,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:10,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 17:00:10,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:10,484 INFO 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-03-04 17:00:10,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:10,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:00:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:10,498 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 17:00:10,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:10,537 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 17:00:10,537 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:10,550 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:10,564 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:10,581 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:10,604 INFO L453 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-03-04 17:00:10,616 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:00:10,621 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:00:10,627 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 17:00:10,632 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:00:10,633 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:10,643 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:10,653 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:10,663 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:10,673 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:10,701 INFO L309 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-03-04 17:00:10,701 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 17:00:10,748 INFO L453 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 31 treesize of output 26 [2019-03-04 17:00:10,749 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:10,767 INFO L309 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-03-04 17:00:10,767 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-03-04 17:00:10,801 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 17:00:10,802 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:10,815 INFO L309 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-03-04 17:00:10,815 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-03-04 17:00:10,862 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 40 [2019-03-04 17:00:10,863 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:10,876 INFO L309 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-03-04 17:00:10,876 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-03-04 17:00:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:10,895 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:10,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:10,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 17:00:10,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:10,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 17:00:10,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 17:00:10,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-03-04 17:00:10,959 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-03-04 17:00:13,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:13,579 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-03-04 17:00:13,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 17:00:13,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 17:00:13,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:13,581 INFO L225 Difference]: With dead ends: 294 [2019-03-04 17:00:13,581 INFO L226 Difference]: Without dead ends: 287 [2019-03-04 17:00:13,581 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-03-04 17:00:13,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-03-04 17:00:15,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-03-04 17:00:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-03-04 17:00:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-03-04 17:00:15,958 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-03-04 17:00:15,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:15,958 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-03-04 17:00:15,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 17:00:15,958 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-03-04 17:00:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 17:00:15,958 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:15,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:00:15,959 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:15,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:15,959 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-03-04 17:00:15,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:15,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:15,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:15,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:15,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 17:00:16,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:16,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:16,089 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 17:00:16,089 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-03-04 17:00:16,090 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 17:00:16,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 17:00:16,638 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 17:00:16,638 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-03-04 17:00:16,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:16,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 17:00:16,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:16,638 INFO 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-03-04 17:00:16,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:16,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:00:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:16,651 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 17:00:16,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:16,655 INFO L453 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-03-04 17:00:16,673 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:00:16,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:16,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:16,687 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:00:16,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:16,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:16,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:16,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:16,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:16,705 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 17:00:16,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:16,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:16,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:16,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:16,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:16,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:16,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:16,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:16,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:16,790 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:00:16,790 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:16,802 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:16,813 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:16,824 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:16,834 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:16,869 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 17:00:16,869 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:16,874 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:16,883 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:16,899 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:16,928 INFO L309 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-03-04 17:00:16,928 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 17:00:16,961 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 17:00:16,961 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:16,988 INFO L309 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-03-04 17:00:16,988 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-03-04 17:00:17,036 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 17:00:17,037 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 17:00:17,073 INFO L309 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-03-04 17:00:17,074 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:76 [2019-03-04 17:00:17,175 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 17:00:17,176 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:17,250 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 49 [2019-03-04 17:00:17,251 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:17,280 INFO L309 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-03-04 17:00:17,280 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:70 [2019-03-04 17:00:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:17,335 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:17,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:17,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-03-04 17:00:17,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:17,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 17:00:17,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 17:00:17,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-03-04 17:00:17,394 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-03-04 17:00:18,656 WARN L181 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-03-04 17:00:19,251 WARN L181 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-03-04 17:00:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:22,316 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-03-04 17:00:22,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 17:00:22,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 17:00:22,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:22,318 INFO L225 Difference]: With dead ends: 364 [2019-03-04 17:00:22,318 INFO L226 Difference]: Without dead ends: 357 [2019-03-04 17:00:22,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-03-04 17:00:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-03-04 17:00:24,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-03-04 17:00:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-03-04 17:00:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-03-04 17:00:24,793 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-03-04 17:00:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:24,793 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-03-04 17:00:24,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 17:00:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-03-04 17:00:24,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 17:00:24,794 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:24,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:00:24,794 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:24,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:24,794 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-03-04 17:00:24,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:24,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:24,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:24,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:24,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:24,994 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-03-04 17:00:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 17:00:25,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:25,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:25,028 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 17:00:25,028 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-03-04 17:00:25,029 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 17:00:25,029 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 17:00:25,564 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 17:00:25,565 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-03-04 17:00:25,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:25,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 17:00:25,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:25,565 INFO 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-03-04 17:00:25,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:25,573 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:00:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:25,578 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 17:00:25,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:25,585 INFO L453 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-03-04 17:00:25,611 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:00:25,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:25,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:25,623 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:00:25,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:25,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:25,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:25,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:25,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:25,640 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 17:00:25,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:25,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:25,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:25,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:25,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:25,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:25,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:25,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:25,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:00:25,656 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:00:25,656 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:25,665 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:25,675 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:25,686 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:25,696 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:25,729 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 17:00:25,730 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:25,736 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:25,749 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:25,765 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:25,793 INFO L309 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-03-04 17:00:25,794 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 17:00:25,838 INFO L453 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 31 treesize of output 26 [2019-03-04 17:00:25,838 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:25,855 INFO L309 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-03-04 17:00:25,855 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-03-04 17:00:25,885 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2019-03-04 17:00:25,885 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:25,897 INFO L309 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-03-04 17:00:25,897 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2019-03-04 17:00:25,939 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 17:00:25,940 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:25,951 INFO L309 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-03-04 17:00:25,951 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 17:00:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:25,969 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:26,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:26,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 17:00:26,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:26,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 17:00:26,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 17:00:26,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-03-04 17:00:26,027 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-03-04 17:00:29,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:29,104 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-03-04 17:00:29,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 17:00:29,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 17:00:29,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:29,106 INFO L225 Difference]: With dead ends: 319 [2019-03-04 17:00:29,106 INFO L226 Difference]: Without dead ends: 312 [2019-03-04 17:00:29,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-03-04 17:00:29,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-03-04 17:00:31,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-03-04 17:00:31,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-03-04 17:00:31,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-03-04 17:00:31,908 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-03-04 17:00:31,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:31,908 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-03-04 17:00:31,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 17:00:31,908 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-03-04 17:00:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 17:00:31,909 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:31,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:00:31,909 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:31,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:31,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-03-04 17:00:31,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:31,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:31,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:31,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:31,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 17:00:32,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:32,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:32,042 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 17:00:32,042 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-03-04 17:00:32,043 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 17:00:32,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 17:00:32,316 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 17:00:32,316 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-03-04 17:00:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:32,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 17:00:32,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:32,316 INFO 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-03-04 17:00:32,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:32,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:00:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:32,331 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 17:00:32,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:32,374 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 17:00:32,375 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:32,388 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:32,402 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:32,421 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:32,447 INFO L453 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-03-04 17:00:32,459 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:00:32,465 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:00:32,470 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 17:00:32,475 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:00:32,475 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:32,484 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:32,494 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:32,504 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:32,514 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:32,542 INFO L309 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-03-04 17:00:32,543 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 17:00:32,581 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 17:00:32,582 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 17:00:32,629 INFO L309 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-03-04 17:00:32,629 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:100 [2019-03-04 17:00:32,735 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 64 [2019-03-04 17:00:32,736 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:32,795 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 43 [2019-03-04 17:00:32,796 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:32,826 INFO L309 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-03-04 17:00:32,826 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-03-04 17:00:32,899 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 17:00:32,900 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:32,971 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 49 [2019-03-04 17:00:32,971 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:33,003 INFO L309 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-03-04 17:00:33,003 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-03-04 17:00:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:33,068 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:33,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:33,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-03-04 17:00:33,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:33,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 17:00:33,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 17:00:33,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-03-04 17:00:33,125 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-03-04 17:00:33,486 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-03-04 17:00:34,632 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-03-04 17:00:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:37,583 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-03-04 17:00:37,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 17:00:37,583 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 17:00:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:37,585 INFO L225 Difference]: With dead ends: 392 [2019-03-04 17:00:37,585 INFO L226 Difference]: Without dead ends: 386 [2019-03-04 17:00:37,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-03-04 17:00:37,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-03-04 17:00:40,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-03-04 17:00:40,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-03-04 17:00:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-03-04 17:00:40,695 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-03-04 17:00:40,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:40,695 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-03-04 17:00:40,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 17:00:40,695 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-03-04 17:00:40,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 17:00:40,696 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:40,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:00:40,696 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:40,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:40,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-03-04 17:00:40,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:40,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:40,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:40,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:40,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 17:00:40,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 17:00:40,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 17:00:40,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 17:00:40,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 17:00:40,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 17:00:40,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 17:00:40,781 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-03-04 17:00:43,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:43,731 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-03-04 17:00:43,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 17:00:43,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-03-04 17:00:43,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:43,733 INFO L225 Difference]: With dead ends: 320 [2019-03-04 17:00:43,733 INFO L226 Difference]: Without dead ends: 315 [2019-03-04 17:00:43,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 17:00:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-03-04 17:00:46,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-03-04 17:00:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-03-04 17:00:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-03-04 17:00:46,850 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-03-04 17:00:46,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:46,850 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-03-04 17:00:46,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 17:00:46,850 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-03-04 17:00:46,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 17:00:46,851 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:46,851 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:00:46,851 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:46,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:46,852 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-03-04 17:00:46,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:46,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:46,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:46,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:46,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 17:00:46,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:46,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:46,961 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:46,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:46,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:46,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 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-03-04 17:00:46,970 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:00:46,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:00:46,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:00:46,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:00:46,976 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 17:00:46,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:46,997 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 17:00:46,997 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:47,003 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:47,015 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:47,032 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:47,055 INFO L453 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-03-04 17:00:47,066 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:00:47,071 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:00:47,077 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 17:00:47,082 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:00:47,082 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:47,092 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:47,102 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:47,112 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:47,122 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:47,151 INFO L309 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-03-04 17:00:47,152 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 17:00:47,179 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 17:00:47,180 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:47,206 INFO L309 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-03-04 17:00:47,207 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:48 [2019-03-04 17:00:47,275 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 38 treesize of output 57 [2019-03-04 17:00:47,276 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:47,301 INFO L309 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-03-04 17:00:47,302 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:48 [2019-03-04 17:00:47,348 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 17:00:47,349 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 17:00:47,388 INFO L309 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-03-04 17:00:47,388 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:76 [2019-03-04 17:00:47,437 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 17:00:47,438 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:47,453 INFO L309 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-03-04 17:00:47,453 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 17:00:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:47,480 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:47,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:47,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 17:00:47,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:47,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 17:00:47,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 17:00:47,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-03-04 17:00:47,565 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-03-04 17:00:53,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:53,746 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-03-04 17:00:53,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 17:00:53,747 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 17:00:53,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:53,748 INFO L225 Difference]: With dead ends: 601 [2019-03-04 17:00:53,749 INFO L226 Difference]: Without dead ends: 591 [2019-03-04 17:00:53,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-03-04 17:00:53,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-03-04 17:00:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-03-04 17:00:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-03-04 17:00:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-03-04 17:00:58,923 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-03-04 17:00:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:58,923 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-03-04 17:00:58,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 17:00:58,923 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-03-04 17:00:58,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 17:00:58,924 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:58,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:00:58,924 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:58,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:58,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-03-04 17:00:58,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:58,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:58,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:00:58,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:58,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 17:00:59,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:59,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:59,011 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 17:00:59,011 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-03-04 17:00:59,012 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 17:00:59,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 17:00:59,279 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 17:00:59,279 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-03-04 17:00:59,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:59,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 17:00:59,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:59,279 INFO 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-03-04 17:00:59,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:59,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:00:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:59,293 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 17:00:59,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:59,323 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 17:00:59,323 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:59,331 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:59,344 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:59,365 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:59,397 INFO L453 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-03-04 17:00:59,413 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:00:59,419 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:00:59,424 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 17:00:59,432 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:00:59,432 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:59,443 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:59,455 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:59,466 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:59,476 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:59,505 INFO L309 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-03-04 17:00:59,506 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 17:00:59,532 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 17:00:59,532 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:59,559 INFO L309 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-03-04 17:00:59,560 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:48 [2019-03-04 17:00:59,599 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 17:00:59,600 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:59,618 INFO L309 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-03-04 17:00:59,618 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-03-04 17:00:59,675 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 50 [2019-03-04 17:00:59,676 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 17:00:59,711 INFO L309 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-03-04 17:00:59,712 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:72 [2019-03-04 17:00:59,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:59,747 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:59,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:59,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 17:00:59,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:59,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 17:00:59,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 17:00:59,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-03-04 17:00:59,798 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-03-04 17:01:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:09,369 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-03-04 17:01:09,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 17:01:09,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 17:01:09,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:09,371 INFO L225 Difference]: With dead ends: 731 [2019-03-04 17:01:09,371 INFO L226 Difference]: Without dead ends: 718 [2019-03-04 17:01:09,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-03-04 17:01:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-03-04 17:01:17,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-03-04 17:01:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-03-04 17:01:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-03-04 17:01:17,686 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-03-04 17:01:17,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:17,686 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-03-04 17:01:17,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 17:01:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-03-04 17:01:17,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 17:01:17,687 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:17,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:01:17,688 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:01:17,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:17,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-03-04 17:01:17,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:17,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:17,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:17,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:17,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 17:01:17,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:17,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:17,829 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 17:01:17,829 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-03-04 17:01:17,833 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 17:01:17,833 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 17:01:18,152 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 17:01:18,153 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-03-04 17:01:18,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:18,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 17:01:18,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:18,153 INFO 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-03-04 17:01:18,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:18,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:01:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:18,169 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 17:01:18,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:18,202 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 17:01:18,203 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:18,217 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:18,231 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:18,254 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:18,280 INFO L453 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-03-04 17:01:18,292 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:01:18,298 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:01:18,304 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 17:01:18,308 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:01:18,308 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:18,319 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:18,329 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:18,339 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:18,349 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:18,377 INFO L309 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-03-04 17:01:18,377 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 17:01:18,426 INFO L453 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 31 treesize of output 26 [2019-03-04 17:01:18,426 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:18,443 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:18,443 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:35 [2019-03-04 17:01:18,477 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 17:01:18,477 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:18,488 INFO L309 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-03-04 17:01:18,488 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-03-04 17:01:18,532 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 17:01:18,532 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:18,542 INFO L309 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-03-04 17:01:18,542 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-03-04 17:01:18,660 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-03-04 17:01:19,019 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 45 [2019-03-04 17:01:19,019 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:19,031 INFO L309 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-03-04 17:01:19,031 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-03-04 17:01:20,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:20,578 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:20,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:20,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:20,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 17:01:20,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:20,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 17:01:20,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 17:01:20,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-03-04 17:01:20,668 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-03-04 17:01:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:30,555 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-03-04 17:01:30,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 17:01:30,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 17:01:30,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:30,556 INFO L225 Difference]: With dead ends: 480 [2019-03-04 17:01:30,556 INFO L226 Difference]: Without dead ends: 473 [2019-03-04 17:01:30,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-03-04 17:01:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-03-04 17:01:33,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-03-04 17:01:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-03-04 17:01:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-03-04 17:01:33,742 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-03-04 17:01:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:33,742 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-03-04 17:01:33,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 17:01:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-03-04 17:01:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 17:01:33,743 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:33,743 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:01:33,743 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:01:33,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:33,744 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-03-04 17:01:33,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:33,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:33,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:33,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:33,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 17:01:33,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:33,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:33,863 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 17:01:33,863 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-03-04 17:01:33,864 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 17:01:33,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 17:01:34,111 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 17:01:34,112 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-03-04 17:01:34,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:34,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 17:01:34,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:34,112 INFO 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-03-04 17:01:34,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:34,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:01:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:34,126 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 17:01:34,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:34,133 INFO L453 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-03-04 17:01:34,148 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:01:34,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:34,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:34,158 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:01:34,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:34,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:34,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:34,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:34,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:34,175 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 17:01:34,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:34,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:34,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:34,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:34,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:34,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:34,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:34,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:34,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:34,199 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:01:34,199 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:34,214 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:34,225 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:34,236 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:34,247 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:34,284 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 17:01:34,285 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:34,289 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:34,300 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:34,317 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:34,345 INFO L309 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-03-04 17:01:34,345 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 17:01:34,393 INFO L453 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 31 treesize of output 26 [2019-03-04 17:01:34,393 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:34,411 INFO L309 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-03-04 17:01:34,412 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 17:01:34,446 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 17:01:34,447 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:34,460 INFO L309 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-03-04 17:01:34,460 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 17:01:34,505 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 17:01:34,506 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:34,519 INFO L309 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-03-04 17:01:34,519 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 17:01:34,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:34,539 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:34,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:34,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 17:01:34,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:34,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 17:01:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 17:01:34,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-03-04 17:01:34,591 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-03-04 17:01:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:39,790 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-03-04 17:01:39,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 17:01:39,791 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 17:01:39,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:39,792 INFO L225 Difference]: With dead ends: 258 [2019-03-04 17:01:39,792 INFO L226 Difference]: Without dead ends: 243 [2019-03-04 17:01:39,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-03-04 17:01:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-03-04 17:01:44,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-03-04 17:01:44,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-03-04 17:01:44,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-03-04 17:01:44,202 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-03-04 17:01:44,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:44,202 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-03-04 17:01:44,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 17:01:44,202 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-03-04 17:01:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 17:01:44,203 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:44,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:01:44,203 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:01:44,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:44,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-03-04 17:01:44,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:44,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:44,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:44,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:44,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:44,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 17:01:44,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:44,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:44,378 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 17:01:44,378 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-03-04 17:01:44,379 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 17:01:44,379 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 17:01:45,004 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 17:01:45,004 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-03-04 17:01:45,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:45,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 17:01:45,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:45,004 INFO 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-03-04 17:01:45,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:45,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:01:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:45,019 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 17:01:45,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:45,024 INFO L453 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-03-04 17:01:45,050 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:01:45,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:45,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:45,064 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:01:45,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:45,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:45,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:45,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:45,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:45,083 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 17:01:45,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:45,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:45,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:45,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:45,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:45,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:45,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:45,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:45,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:45,099 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:01:45,100 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:45,110 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:45,121 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:45,132 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:45,143 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:45,178 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 17:01:45,179 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:45,186 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:45,199 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:45,215 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:45,243 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:45,244 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-03-04 17:01:45,282 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 17:01:45,282 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:45,309 INFO L309 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-03-04 17:01:45,309 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-03-04 17:01:45,364 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 17:01:45,365 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 17:01:45,427 INFO L309 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-03-04 17:01:45,428 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:80 [2019-03-04 17:01:45,541 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 48 [2019-03-04 17:01:45,542 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:45,614 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 52 treesize of output 53 [2019-03-04 17:01:45,615 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:45,650 INFO L309 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-03-04 17:01:45,650 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:70 [2019-03-04 17:01:45,746 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 46 treesize of output 62 [2019-03-04 17:01:45,747 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:45,803 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 17:01:45,803 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:45,837 INFO L309 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-03-04 17:01:45,837 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-03-04 17:01:45,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:45,881 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:45,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:45,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 17:01:45,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:45,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 17:01:45,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 17:01:45,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-03-04 17:01:45,948 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-03-04 17:01:52,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:52,079 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-03-04 17:01:52,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 17:01:52,080 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 17:01:52,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:52,081 INFO L225 Difference]: With dead ends: 295 [2019-03-04 17:01:52,081 INFO L226 Difference]: Without dead ends: 284 [2019-03-04 17:01:52,081 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-03-04 17:01:52,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-03-04 17:01:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-03-04 17:01:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-03-04 17:01:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-03-04 17:01:56,739 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-03-04 17:01:56,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:56,739 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-03-04 17:01:56,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 17:01:56,739 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-03-04 17:01:56,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 17:01:56,740 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:56,740 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:01:56,740 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:01:56,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:56,740 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-03-04 17:01:56,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:56,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:56,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:56,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:56,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 17:01:56,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:56,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:56,861 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 17:01:56,861 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-03-04 17:01:56,862 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 17:01:56,862 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 17:01:57,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 17:01:57,296 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-03-04 17:01:57,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:57,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 17:01:57,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:57,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 17:01:57,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:57,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:01:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:57,312 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 17:01:57,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:57,320 INFO L453 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-03-04 17:01:57,340 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:01:57,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:57,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:57,354 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:01:57,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:57,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:57,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:57,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:57,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:57,369 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 17:01:57,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:57,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:57,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:57,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:57,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:57,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:57,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:57,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:57,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:01:57,388 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:01:57,389 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:57,398 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:57,408 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:57,417 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:57,428 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:57,463 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 17:01:57,463 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:57,471 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:57,482 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:57,498 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:57,526 INFO L309 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-03-04 17:01:57,527 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 17:01:57,546 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 17:01:57,546 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:57,573 INFO L309 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-03-04 17:01:57,574 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 17:01:57,611 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 17:01:57,612 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 17:01:57,651 INFO L309 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-03-04 17:01:57,651 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:76 [2019-03-04 17:01:59,593 WARN L181 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 44 DAG size of output: 25 [2019-03-04 17:01:59,610 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 17:01:59,610 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:59,625 INFO L309 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-03-04 17:01:59,625 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 17:01:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:59,644 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:59,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:59,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:59,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 17:01:59,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:59,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 17:01:59,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 17:01:59,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-03-04 17:01:59,689 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-03-04 17:02:06,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:02:06,554 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-03-04 17:02:06,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 17:02:06,554 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 17:02:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:02:06,555 INFO L225 Difference]: With dead ends: 328 [2019-03-04 17:02:06,555 INFO L226 Difference]: Without dead ends: 315 [2019-03-04 17:02:06,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-03-04 17:02:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-03-04 17:02:13,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-03-04 17:02:13,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-03-04 17:02:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-03-04 17:02:13,008 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-03-04 17:02:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:02:13,008 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-03-04 17:02:13,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 17:02:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-03-04 17:02:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 17:02:13,009 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:02:13,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:02:13,009 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:02:13,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:13,009 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-03-04 17:02:13,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:02:13,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:13,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:02:13,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:13,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:02:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 17:02:13,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:13,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:02:13,200 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 17:02:13,201 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-03-04 17:02:13,201 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 17:02:13,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 17:02:13,449 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 17:02:13,449 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-03-04 17:02:13,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:13,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 17:02:13,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:13,450 INFO 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-03-04 17:02:13,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:02:13,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:02:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:13,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 17:02:13,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:02:13,503 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 17:02:13,504 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:13,510 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:13,521 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:13,544 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:13,563 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:13,592 INFO L453 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-03-04 17:02:13,595 INFO L453 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 23 [2019-03-04 17:02:13,598 INFO L453 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 25 [2019-03-04 17:02:13,600 INFO L453 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 27 [2019-03-04 17:02:13,604 INFO L453 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 26 [2019-03-04 17:02:13,604 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:13,614 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:13,624 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:13,634 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:13,644 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:13,675 INFO L309 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-03-04 17:02:13,675 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 17:02:13,713 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 17:02:13,713 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:13,741 INFO L309 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-03-04 17:02:13,742 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 17:02:13,781 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 17:02:13,782 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:13,803 INFO L309 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-03-04 17:02:13,803 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:40 [2019-03-04 17:02:13,858 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 17:02:13,859 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:13,878 INFO L309 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-03-04 17:02:13,878 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-03-04 17:02:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:13,905 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:02:13,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-03-04 17:02:13,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:02:13,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 17:02:13,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:02:13,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 17:02:13,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 17:02:13,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-03-04 17:02:13,964 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-03-04 17:02:23,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:02:23,223 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-03-04 17:02:23,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 17:02:23,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 17:02:23,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:02:23,225 INFO L225 Difference]: With dead ends: 326 [2019-03-04 17:02:23,225 INFO L226 Difference]: Without dead ends: 313 [2019-03-04 17:02:23,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-03-04 17:02:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-03-04 17:02:31,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-03-04 17:02:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-03-04 17:02:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-03-04 17:02:31,094 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-03-04 17:02:31,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:02:31,094 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-03-04 17:02:31,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 17:02:31,094 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-03-04 17:02:31,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 17:02:31,095 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:02:31,095 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:02:31,095 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:02:31,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:31,096 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-03-04 17:02:31,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:02:31,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:31,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:02:31,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:31,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:02:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 17:02:31,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:31,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:02:31,182 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 17:02:31,182 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-03-04 17:02:31,183 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 17:02:31,183 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 17:02:31,452 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 17:02:31,452 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-03-04 17:02:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:31,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 17:02:31,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:31,452 INFO 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-03-04 17:02:31,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:02:31,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:02:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:31,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 17:02:31,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:02:31,492 INFO L453 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-03-04 17:02:31,510 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:02:31,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:31,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:31,520 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:02:31,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:31,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:31,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:31,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:31,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:31,540 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 17:02:31,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:31,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:31,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:31,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:31,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:31,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:31,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:31,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:31,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:31,562 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:02:31,562 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:31,574 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:31,585 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:31,599 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:31,612 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:31,734 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 17:02:31,734 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:31,740 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:31,752 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:31,768 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:31,796 INFO L309 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-03-04 17:02:31,796 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 17:02:31,831 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 17:02:31,832 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 17:02:31,875 INFO L309 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-03-04 17:02:31,876 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:100 [2019-03-04 17:02:31,913 INFO L453 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 33 treesize of output 28 [2019-03-04 17:02:31,913 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:31,932 INFO L309 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-03-04 17:02:31,932 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:33 [2019-03-04 17:02:31,972 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 36 [2019-03-04 17:02:31,972 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:31,984 INFO L309 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-03-04 17:02:31,984 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-03-04 17:02:32,028 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 35 treesize of output 39 [2019-03-04 17:02:32,029 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:32,039 INFO L309 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-03-04 17:02:32,039 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-03-04 17:02:32,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:32,060 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:02:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:32,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:02:32,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-03-04 17:02:32,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:02:32,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 17:02:32,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 17:02:32,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-03-04 17:02:32,124 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-03-04 17:02:43,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:02:43,341 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-03-04 17:02:43,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 17:02:43,342 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-03-04 17:02:43,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:02:43,343 INFO L225 Difference]: With dead ends: 400 [2019-03-04 17:02:43,343 INFO L226 Difference]: Without dead ends: 393 [2019-03-04 17:02:43,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-03-04 17:02:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-03-04 17:02:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-03-04 17:02:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-03-04 17:02:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-03-04 17:02:53,336 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-03-04 17:02:53,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:02:53,336 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-03-04 17:02:53,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 17:02:53,336 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-03-04 17:02:53,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 17:02:53,337 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:02:53,337 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:02:53,338 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:02:53,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:53,338 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-03-04 17:02:53,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:02:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:53,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:02:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:53,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:02:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:53,548 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2019-03-04 17:02:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 17:02:53,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:53,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:02:53,609 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 17:02:53,610 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-03-04 17:02:53,610 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 17:02:53,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 17:02:53,869 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 17:02:53,869 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-03-04 17:02:53,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:53,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 17:02:53,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:53,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 17:02:53,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:02:53,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:02:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:53,883 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 17:02:53,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:02:53,890 INFO L453 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-03-04 17:02:53,909 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:02:53,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:53,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:53,923 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:02:53,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:53,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:53,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:53,943 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:53,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:53,946 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 17:02:53,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:53,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:53,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:53,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:53,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:53,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:53,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:53,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:53,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:02:53,965 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:02:53,966 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:53,975 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:53,985 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:53,996 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:54,007 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:54,043 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 17:02:54,043 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:54,049 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:54,062 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:54,078 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:54,107 INFO L309 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-03-04 17:02:54,107 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 17:02:54,142 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 17:02:54,143 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 17:02:54,190 INFO L309 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-03-04 17:02:54,190 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:100 [2019-03-04 17:02:54,274 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 64 [2019-03-04 17:02:54,275 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:54,345 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 47 [2019-03-04 17:02:54,345 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:54,381 INFO L309 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-03-04 17:02:54,382 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:116, output treesize:80 [2019-03-04 17:02:54,450 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 65 [2019-03-04 17:02:54,451 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:54,522 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 17:02:54,523 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:54,556 INFO L309 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-03-04 17:02:54,556 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-03-04 17:02:54,653 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 48 treesize of output 67 [2019-03-04 17:02:54,654 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:54,711 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 47 [2019-03-04 17:02:54,712 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:54,745 INFO L309 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-03-04 17:02:54,745 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-03-04 17:02:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:54,789 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:02:54,839 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:54,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:02:54,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-03-04 17:02:54,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:02:54,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 17:02:54,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 17:02:54,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-03-04 17:02:54,859 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-03-04 17:03:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:03:07,158 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-03-04 17:03:07,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 17:03:07,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-03-04 17:03:07,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:03:07,160 INFO L225 Difference]: With dead ends: 441 [2019-03-04 17:03:07,160 INFO L226 Difference]: Without dead ends: 428 [2019-03-04 17:03:07,161 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-03-04 17:03:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-03-04 17:03:17,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-03-04 17:03:17,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-03-04 17:03:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-03-04 17:03:17,248 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-03-04 17:03:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:03:17,248 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-03-04 17:03:17,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 17:03:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-03-04 17:03:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 17:03:17,249 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:03:17,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:03:17,249 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:03:17,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:17,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-03-04 17:03:17,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:03:17,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:17,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:03:17,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:17,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:03:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:17,538 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-03-04 17:03:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 17:03:17,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:17,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:03:17,621 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 17:03:17,621 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-03-04 17:03:17,622 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 17:03:17,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 17:03:17,939 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 17:03:17,939 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-03-04 17:03:17,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:17,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 17:03:17,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:17,940 INFO 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-03-04 17:03:17,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:03:17,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:03:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:17,954 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 17:03:17,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:03:17,959 INFO L453 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-03-04 17:03:17,977 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:03:17,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:03:17,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:03:17,995 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:03:17,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:03:18,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:03:18,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:03:18,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:03:18,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:03:18,010 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 17:03:18,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:03:18,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:03:18,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:03:18,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:03:18,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:03:18,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:03:18,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:03:18,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:03:18,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:03:18,032 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:03:18,032 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:18,041 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:18,051 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:18,062 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:18,073 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:18,109 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 17:03:18,110 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:18,116 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:18,125 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:18,141 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:18,170 INFO L309 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-03-04 17:03:18,170 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 17:03:18,208 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 17:03:18,209 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 17:03:18,253 INFO L309 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-03-04 17:03:18,254 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:100 [2019-03-04 17:03:18,367 INFO L453 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 47 [2019-03-04 17:03:18,368 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:18,430 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 64 [2019-03-04 17:03:18,431 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:18,466 INFO L309 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-03-04 17:03:18,466 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-03-04 17:03:18,536 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 17:03:18,536 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:18,601 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 46 [2019-03-04 17:03:18,602 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:18,631 INFO L309 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-03-04 17:03:18,632 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:68 [2019-03-04 17:03:18,697 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 39 treesize of output 44 [2019-03-04 17:03:18,698 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:18,773 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 48 treesize of output 60 [2019-03-04 17:03:18,774 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:18,805 INFO L309 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-03-04 17:03:18,806 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-03-04 17:03:19,046 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-03-04 17:03:19,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:19,053 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:19,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:19,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 17:03:19,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:19,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 17:03:19,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 17:03:19,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-03-04 17:03:19,126 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-03-04 17:03:26,644 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-03-04 17:03:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:03:39,098 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-03-04 17:03:39,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 17:03:39,098 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 17:03:39,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:03:39,100 INFO L225 Difference]: With dead ends: 685 [2019-03-04 17:03:39,100 INFO L226 Difference]: Without dead ends: 677 [2019-03-04 17:03:39,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-03-04 17:03:39,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-03-04 17:03:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-03-04 17:03:54,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-03-04 17:03:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-03-04 17:03:54,224 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-03-04 17:03:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:03:54,224 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-03-04 17:03:54,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 17:03:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-03-04 17:03:54,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 17:03:54,226 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:03:54,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:03:54,226 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:03:54,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:54,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-03-04 17:03:54,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:03:54,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:54,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:03:54,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:54,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:03:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 17:03:54,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:54,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:03:54,393 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:03:54,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:03:54,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:54,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 17:03:54,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:03:54,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:03:54,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 17:03:54,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:03:54,408 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 17:03:54,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:03:54,437 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 17:03:54,437 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:54,443 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:54,453 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:54,469 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:54,491 INFO L453 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-03-04 17:03:54,505 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:03:54,508 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:03:54,514 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 17:03:54,519 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:03:54,520 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:54,530 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:54,538 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:54,548 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:54,558 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:54,586 INFO L309 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-03-04 17:03:54,586 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 17:03:54,628 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 17:03:54,629 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 17:03:54,673 INFO L309 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-03-04 17:03:54,673 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:100 [2019-03-04 17:03:54,780 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 60 [2019-03-04 17:03:54,781 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:54,858 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 17:03:54,859 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:54,899 INFO L309 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-03-04 17:03:54,899 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-03-04 17:03:54,989 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 17:03:54,990 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:55,042 INFO L453 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 55 treesize of output 50 [2019-03-04 17:03:55,043 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:55,081 INFO L309 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-03-04 17:03:55,081 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:74 [2019-03-04 17:03:56,062 WARN L181 SmtUtils]: Spent 965.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-03-04 17:03:56,099 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 43 [2019-03-04 17:03:56,100 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:56,179 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 48 treesize of output 56 [2019-03-04 17:03:56,180 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:56,207 INFO L309 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-03-04 17:03:56,208 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-03-04 17:03:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:56,261 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:56,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:56,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-03-04 17:03:56,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:56,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 17:03:56,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 17:03:56,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-03-04 17:03:56,344 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-03-04 17:03:56,540 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-03-04 17:03:57,161 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-03-04 17:03:58,015 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-03-04 17:04:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:04:11,478 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-03-04 17:04:11,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 17:04:11,478 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-03-04 17:04:11,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:04:11,480 INFO L225 Difference]: With dead ends: 550 [2019-03-04 17:04:11,480 INFO L226 Difference]: Without dead ends: 543 [2019-03-04 17:04:11,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-03-04 17:04:11,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-03-04 17:04:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-03-04 17:04:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-03-04 17:04:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-03-04 17:04:14,532 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-03-04 17:04:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:04:14,533 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-03-04 17:04:14,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 17:04:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-03-04 17:04:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 17:04:14,533 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:04:14,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:04:14,533 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:04:14,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:04:14,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-03-04 17:04:14,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:04:14,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:14,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:04:14,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:14,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:04:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:14,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 17:04:14,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:14,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:04:14,709 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-03-04 17:04:14,709 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-03-04 17:04:14,710 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 17:04:14,710 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 17:04:15,040 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 17:04:15,041 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-03-04 17:04:15,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:04:15,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 17:04:15,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:15,041 INFO 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-03-04 17:04:15,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:04:15,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:04:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:15,058 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 17:04:15,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:04:15,102 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 17:04:15,102 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:15,113 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:15,124 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:15,141 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:15,160 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:15,185 INFO L453 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-03-04 17:04:15,188 INFO L453 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 23 [2019-03-04 17:04:15,192 INFO L453 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 25 [2019-03-04 17:04:15,195 INFO L453 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 27 [2019-03-04 17:04:15,198 INFO L453 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 26 [2019-03-04 17:04:15,198 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:15,209 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:15,217 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:15,227 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:15,237 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:15,268 INFO L309 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-03-04 17:04:15,268 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 17:04:15,334 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 17:04:15,335 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:15,506 INFO L309 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-03-04 17:04:15,507 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 17:04:15,547 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 17:04:15,548 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:15,570 INFO L309 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-03-04 17:04:15,570 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 17:04:15,623 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 17:04:15,624 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:15,643 INFO L309 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-03-04 17:04:15,643 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-03-04 17:04:15,710 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 40 treesize of output 52 [2019-03-04 17:04:15,711 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:15,726 INFO L309 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-03-04 17:04:15,727 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 17:04:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:16,026 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:04:16,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:16,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:04:16,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-03-04 17:04:16,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:04:16,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 17:04:16,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 17:04:16,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-03-04 17:04:16,147 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-03-04 17:04:22,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:04:22,079 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-03-04 17:04:22,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 17:04:22,080 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-03-04 17:04:22,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:04:22,080 INFO L225 Difference]: With dead ends: 67 [2019-03-04 17:04:22,080 INFO L226 Difference]: Without dead ends: 58 [2019-03-04 17:04:22,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-03-04 17:04:22,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-03-04 17:04:25,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-03-04 17:04:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-03-04 17:04:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-03-04 17:04:25,331 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-03-04 17:04:25,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:04:25,331 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-03-04 17:04:25,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 17:04:25,331 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-03-04 17:04:25,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 17:04:25,332 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:04:25,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:04:25,332 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:04:25,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:04:25,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-03-04 17:04:25,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:04:25,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:25,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:04:25,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:25,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:04:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-03-04 17:04:25,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:25,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:04:25,481 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-03-04 17:04:25,482 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-03-04 17:04:25,482 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 17:04:25,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 17:04:25,787 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 17:04:25,787 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-03-04 17:04:25,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:04:25,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 17:04:25,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:25,788 INFO 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-03-04 17:04:25,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:04:25,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:04:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:25,802 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 17:04:25,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:04:25,837 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 17:04:25,837 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:25,850 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:25,862 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:25,887 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:25,908 INFO L453 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-03-04 17:04:25,923 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:04:25,927 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:04:25,932 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 17:04:25,938 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:04:25,938 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:25,948 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:25,958 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:25,968 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:25,978 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:26,006 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:26,006 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-03-04 17:04:26,044 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 17:04:26,045 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:26,071 INFO L309 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-03-04 17:04:26,072 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:48 [2019-03-04 17:04:26,124 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 17:04:26,124 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 17:04:26,160 INFO L309 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-03-04 17:04:26,160 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:76 [2019-03-04 17:04:26,275 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 46 [2019-03-04 17:04:26,276 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:26,338 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 17:04:26,339 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:26,369 INFO L309 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-03-04 17:04:26,369 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-03-04 17:04:26,462 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 46 treesize of output 58 [2019-03-04 17:04:26,463 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:26,524 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 17:04:26,525 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:26,554 INFO L309 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-03-04 17:04:26,555 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:66 [2019-03-04 17:04:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:26,614 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:04:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:26,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:04:26,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 17:04:26,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:04:26,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 17:04:26,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 17:04:26,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-03-04 17:04:26,691 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-03-04 17:04:32,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:04:32,948 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-03-04 17:04:32,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 17:04:32,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-03-04 17:04:32,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:04:32,949 INFO L225 Difference]: With dead ends: 74 [2019-03-04 17:04:32,949 INFO L226 Difference]: Without dead ends: 59 [2019-03-04 17:04:32,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-03-04 17:04:32,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-03-04 17:04:36,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-03-04 17:04:36,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-03-04 17:04:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-03-04 17:04:36,430 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-03-04 17:04:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:04:36,430 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-03-04 17:04:36,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 17:04:36,431 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-03-04 17:04:36,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 17:04:36,431 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:04:36,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:04:36,431 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:04:36,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:04:36,431 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-03-04 17:04:36,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:04:36,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:36,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:04:36,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:36,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:04:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 17:04:36,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:36,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:04:36,584 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-03-04 17:04:36,584 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-03-04 17:04:36,585 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 17:04:36,585 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 17:04:36,942 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 17:04:36,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-03-04 17:04:36,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:04:36,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 17:04:36,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:36,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-03-04 17:04:36,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:04:36,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:04:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:36,956 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 17:04:36,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:04:36,987 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 17:04:36,987 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:36,995 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:37,007 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:37,028 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:37,051 INFO L453 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-03-04 17:04:37,063 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:04:37,068 INFO L453 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 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:04:37,073 INFO L453 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 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 17:04:37,078 INFO L453 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 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:04:37,079 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:37,089 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:37,097 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:37,107 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:37,117 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:37,145 INFO L309 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-03-04 17:04:37,146 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 17:04:37,191 INFO L453 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 31 treesize of output 26 [2019-03-04 17:04:37,191 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:37,208 INFO L309 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-03-04 17:04:37,208 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-03-04 17:04:37,240 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 17:04:37,241 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:37,254 INFO L309 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-03-04 17:04:37,254 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2019-03-04 17:04:37,366 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 17:04:37,367 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:37,376 INFO L309 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-03-04 17:04:37,376 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 17:04:37,424 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 35 treesize of output 43 [2019-03-04 17:04:37,425 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:37,435 INFO L309 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-03-04 17:04:37,435 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-03-04 17:04:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:37,455 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:04:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:37,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:04:37,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-03-04 17:04:37,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:04:37,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 17:04:37,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 17:04:37,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-03-04 17:04:37,512 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-03-04 17:04:44,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:04:44,707 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-03-04 17:04:44,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 17:04:44,708 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-03-04 17:04:44,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:04:44,708 INFO L225 Difference]: With dead ends: 80 [2019-03-04 17:04:44,708 INFO L226 Difference]: Without dead ends: 71 [2019-03-04 17:04:44,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-03-04 17:04:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-03-04 17:04:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-03-04 17:04:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-03-04 17:04:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-03-04 17:04:50,924 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-03-04 17:04:50,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:04:50,924 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-03-04 17:04:50,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 17:04:50,924 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-03-04 17:04:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-03-04 17:04:50,925 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:04:50,925 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 17:04:50,925 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:04:50,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:04:50,925 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-03-04 17:04:50,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:04:50,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:50,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:04:50,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:50,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:04:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-03-04 17:04:51,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:51,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:04:51,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:04:51,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:04:51,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:51,046 INFO 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-03-04 17:04:51,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:04:51,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:04:51,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 17:04:51,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:04:51,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 17:04:51,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:04:51,068 INFO L453 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-03-04 17:04:51,089 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 17:04:51,112 INFO L453 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 17:04:51,145 INFO L453 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-03-04 17:04:51,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:04:51,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:04:51,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:04:51,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 17:04:51,160 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 17:04:51,160 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:51,171 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:51,181 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:51,192 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:51,202 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:51,224 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2019-03-04 17:04:51,224 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:51,232 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:51,249 INFO L309 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-03-04 17:04:51,249 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-03-04 17:04:51,284 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 17:04:51,285 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 17:04:51,304 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-03-04 17:04:51,305 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:43 [2019-03-04 17:04:51,358 INFO L453 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 24 [2019-03-04 17:04:51,359 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:51,391 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 30 [2019-03-04 17:04:51,391 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:51,407 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-03-04 17:04:51,408 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-03-04 17:04:51,456 INFO L453 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 37 [2019-03-04 17:04:51,456 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:51,488 INFO L453 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:04:51,489 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:51,502 INFO L309 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-03-04 17:04:51,503 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2019-03-04 17:04:51,538 INFO L453 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 17:04:51,539 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:51,583 INFO L453 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 37 [2019-03-04 17:04:51,584 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:51,600 INFO L309 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-03-04 17:04:51,600 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:34 [2019-03-04 17:04:51,645 INFO L453 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 30 treesize of output 35 [2019-03-04 17:04:51,645 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:51,673 INFO L453 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 21 [2019-03-04 17:04:51,673 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:51,688 INFO L309 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-03-04 17:04:51,688 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:38 [2019-03-04 17:04:51,722 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:51,723 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:04:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:51,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:04:51,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-03-04 17:04:51,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:04:51,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 17:04:51,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 17:04:51,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-03-04 17:04:51,811 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-03-04 17:04:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:04:58,685 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-03-04 17:04:58,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 17:04:58,686 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-03-04 17:04:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:04:58,686 INFO L225 Difference]: With dead ends: 71 [2019-03-04 17:04:58,686 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 17:04:58,687 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-03-04 17:04:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 17:04:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 17:04:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 17:04:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 17:04:58,688 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-03-04 17:04:58,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:04:58,688 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 17:04:58,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 17:04:58,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 17:04:58,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 17:04:58,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 17:04:58,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:04:58,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:04:59,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:04,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:07,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:08,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:08,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:08,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:09,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:09,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:10,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:13,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:13,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:13,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:23,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:23,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:27,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:27,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:27,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:27,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:28,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:28,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:28,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:28,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:28,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:29,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:30,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:30,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:30,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:30,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:30,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:30,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:30,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:31,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:34,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:34,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:34,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:35,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:35,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:35,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:35,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:38,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:48,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:52,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:52,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:53,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:05:57,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:06:01,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:06:06,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:06:10,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 17:06:12,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent.