java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:38:29,388 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:38:29,390 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:38:29,401 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:38:29,402 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:38:29,403 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:38:29,404 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:38:29,406 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:38:29,407 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:38:29,408 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:38:29,409 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:38:29,409 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:38:29,410 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:38:29,411 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:38:29,412 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:38:29,413 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:38:29,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:38:29,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:38:29,418 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:38:29,419 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:38:29,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:38:29,421 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:38:29,424 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:38:29,424 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:38:29,424 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:38:29,425 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:38:29,426 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:38:29,427 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:38:29,428 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:38:29,429 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:38:29,429 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:38:29,430 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:38:29,430 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:38:29,430 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:38:29,431 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:38:29,432 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:38:29,432 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-18 09:38:29,449 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:38:29,449 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:38:29,450 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:38:29,450 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:38:29,450 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:38:29,451 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:38:29,451 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:38:29,451 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:38:29,451 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-18 09:38:29,451 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:38:29,451 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-18 09:38:29,454 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-18 09:38:29,455 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:38:29,455 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:38:29,456 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:38:29,456 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:38:29,456 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:38:29,456 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:38:29,456 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:38:29,457 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:38:29,457 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:38:29,459 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:38:29,459 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:38:29,459 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:38:29,459 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:38:29,460 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:38:29,460 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:38:29,460 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:38:29,460 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:38:29,461 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:38:29,461 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:38:29,461 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:38:29,461 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:38:29,461 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:38:29,461 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:38:29,462 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:38:29,462 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:38:29,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:38:29,463 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:38:29,463 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:38:29,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:38:29,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:38:29,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:38:29,538 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:38:29,540 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:38:29,540 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-02-18 09:38:29,541 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-02-18 09:38:29,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:38:29,584 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:38:29,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:38:29,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:38:29,586 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:38:29,603 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 18.02 09:38:29" (1/1) ... [2019-02-18 09:38:29,612 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 18.02 09:38:29" (1/1) ... [2019-02-18 09:38:29,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:38:29,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:38:29,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:38:29,636 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:38:29,645 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 18.02 09:38:29" (1/1) ... [2019-02-18 09:38:29,645 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 18.02 09:38:29" (1/1) ... [2019-02-18 09:38:29,647 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 18.02 09:38:29" (1/1) ... [2019-02-18 09:38:29,647 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 18.02 09:38:29" (1/1) ... [2019-02-18 09:38:29,651 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 18.02 09:38:29" (1/1) ... [2019-02-18 09:38:29,654 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 18.02 09:38:29" (1/1) ... [2019-02-18 09:38:29,655 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 18.02 09:38:29" (1/1) ... [2019-02-18 09:38:29,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:38:29,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:38:29,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:38:29,658 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:38:29,658 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 18.02 09:38:29" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:38:29,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 09:38:29,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 09:38:30,106 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 09:38:30,106 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-02-18 09:38:30,107 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:38:30 BoogieIcfgContainer [2019-02-18 09:38:30,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:38:30,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:38:30,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:38:30,113 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:38:30,113 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 18.02 09:38:29" (1/2) ... [2019-02-18 09:38:30,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348c7367 and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:38:30, skipping insertion in model container [2019-02-18 09:38:30,114 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 18.02 09:38:30" (2/2) ... [2019-02-18 09:38:30,117 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-02-18 09:38:30,128 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:38:30,137 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-02-18 09:38:30,158 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-02-18 09:38:30,191 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:38:30,192 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:38:30,192 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:38:30,192 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:38:30,192 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:38:30,192 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:38:30,193 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:38:30,193 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:38:30,209 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-02-18 09:38:30,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-18 09:38:30,215 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:30,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-18 09:38:30,219 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:30,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:30,226 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-02-18 09:38:30,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:30,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:30,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:30,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:30,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:30,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:30,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:38:30,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:38:30,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:30,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:38:30,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:38:30,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:30,434 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-02-18 09:38:30,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:30,570 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-02-18 09:38:30,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:30,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-18 09:38:30,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:30,585 INFO L225 Difference]: With dead ends: 25 [2019-02-18 09:38:30,585 INFO L226 Difference]: Without dead ends: 20 [2019-02-18 09:38:30,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:30,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-18 09:38:30,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-02-18 09:38:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-18 09:38:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-02-18 09:38:30,622 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-02-18 09:38:30,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:30,623 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-02-18 09:38:30,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:38:30,624 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-02-18 09:38:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:30,624 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:30,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:30,625 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:30,625 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-02-18 09:38:30,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:30,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:30,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:30,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:30,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:30,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:30,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:30,834 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:38:30,836 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-02-18 09:38:30,881 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:30,881 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:30,951 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:30,952 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:30,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:30,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:30,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:30,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:30,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:30,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:31,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:31,184 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-02-18 09:38:31,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:31,488 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-18 09:38:31,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:31,707 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-02-18 09:38:31,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:31,773 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:31,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:38:31,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:38:32,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:38:32,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:38:32,026 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,076 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,107 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,126 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,164 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:32,194 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-18 09:38:32,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:32,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:32,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:32,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:32,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:32,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:32,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:32,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:32,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:32,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:32,835 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-02-18 09:38:33,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:33,196 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-02-18 09:38:33,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:33,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 09:38:33,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:33,198 INFO L225 Difference]: With dead ends: 39 [2019-02-18 09:38:33,199 INFO L226 Difference]: Without dead ends: 37 [2019-02-18 09:38:33,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:38:33,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-18 09:38:33,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-02-18 09:38:33,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-18 09:38:33,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-02-18 09:38:33,206 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-02-18 09:38:33,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:33,206 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-02-18 09:38:33,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-02-18 09:38:33,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:33,207 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:33,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:33,208 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:33,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:33,208 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-02-18 09:38:33,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:33,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:33,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:33,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:33,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:33,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:33,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:33,409 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:38:33,409 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-02-18 09:38:33,412 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:33,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:33,419 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:33,419 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:33,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:33,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:33,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:33,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:33,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:33,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:33,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:33,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:33,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:33,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:33,598 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,614 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:33,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:38:33,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:38:33,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:38:33,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:38:33,729 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,757 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,789 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,801 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,813 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:33,870 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-18 09:38:33,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:38:33,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-18 09:38:34,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-18 09:38:34,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:183 [2019-02-18 09:38:34,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:34,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:34,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:34,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:38:34,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-18 09:38:34,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:34,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:38:34,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:38:34,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:38:34,438 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-02-18 09:38:34,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:34,481 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-02-18 09:38:34,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:34,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-18 09:38:34,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:34,484 INFO L225 Difference]: With dead ends: 18 [2019-02-18 09:38:34,484 INFO L226 Difference]: Without dead ends: 17 [2019-02-18 09:38:34,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:38:34,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-18 09:38:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-18 09:38:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 09:38:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-02-18 09:38:34,490 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-02-18 09:38:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:34,490 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-02-18 09:38:34,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:38:34,490 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-02-18 09:38:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:34,490 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:34,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:34,491 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:34,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:34,491 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-02-18 09:38:34,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:34,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:34,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:34,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:34,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:34,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:38:34,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:38:34,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:34,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:38:34,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:38:34,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:34,521 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-02-18 09:38:34,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:34,582 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-02-18 09:38:34,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:34,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 09:38:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:34,583 INFO L225 Difference]: With dead ends: 21 [2019-02-18 09:38:34,584 INFO L226 Difference]: Without dead ends: 20 [2019-02-18 09:38:34,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-18 09:38:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-02-18 09:38:34,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 09:38:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-02-18 09:38:34,590 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-02-18 09:38:34,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:34,590 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-02-18 09:38:34,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:38:34,591 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-02-18 09:38:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:34,591 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:34,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:34,592 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:34,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:34,592 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-02-18 09:38:34,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:34,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:34,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:34,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:34,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:34,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:34,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:34,653 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:38:34,653 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-02-18 09:38:34,655 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:34,655 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:34,661 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:34,661 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:34,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:34,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:34,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:34,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:34,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:34,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:34,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:34,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:34,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:38:34,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:38:34,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:38:34,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:38:34,785 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,825 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,841 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,852 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:34,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:35,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:35,012 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,020 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,030 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:35,053 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-18 09:38:35,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:38:35,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:35,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:35,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:35,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:35,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:35,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:35,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:35,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:35,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:35,246 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-02-18 09:38:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:35,401 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-02-18 09:38:35,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:35,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 09:38:35,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:35,405 INFO L225 Difference]: With dead ends: 39 [2019-02-18 09:38:35,405 INFO L226 Difference]: Without dead ends: 38 [2019-02-18 09:38:35,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:38:35,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-18 09:38:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-02-18 09:38:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-18 09:38:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-02-18 09:38:35,411 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-02-18 09:38:35,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:35,411 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-02-18 09:38:35,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:35,411 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-02-18 09:38:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:35,412 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:35,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:35,412 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:35,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:35,413 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-02-18 09:38:35,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:35,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:35,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:35,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:35,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:35,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:35,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:35,499 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:35,500 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-02-18 09:38:35,501 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:35,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:35,507 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:35,507 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:35,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:35,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:35,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:35,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:35,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:35,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:35,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:35,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:35,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:38:35,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:38:35,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:38:35,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:38:35,684 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,781 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,847 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:36,025 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-18 09:38:36,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:36,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:36,089 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,102 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,111 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:36,134 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-18 09:38:36,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-02-18 09:38:36,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:38:36,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:38:36,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:74 [2019-02-18 09:38:36,630 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-02-18 09:38:36,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-02-18 09:38:36,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-18 09:38:36,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,972 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:36,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-02-18 09:38:36,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-18 09:38:37,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-02-18 09:38:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:37,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:37,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:37,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:37,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:37,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:37,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:37,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:37,323 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-02-18 09:38:37,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:37,944 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-02-18 09:38:37,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:37,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:37,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:37,947 INFO L225 Difference]: With dead ends: 59 [2019-02-18 09:38:37,948 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 09:38:37,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:37,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 09:38:37,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-02-18 09:38:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-18 09:38:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-02-18 09:38:37,957 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-02-18 09:38:37,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:37,957 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-02-18 09:38:37,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:37,958 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-02-18 09:38:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:37,958 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:37,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:37,960 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:37,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:37,960 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-02-18 09:38:37,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:37,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:37,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:37,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:37,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:38,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:38,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:38,008 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:38,008 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-02-18 09:38:38,010 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:38,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:38,018 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:38,019 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:38,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:38,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:38,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:38,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:38,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:38,032 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:38,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:38,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:38,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:38:38,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:38:38,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:38:38,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 09:38:38,091 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,130 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,153 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 09:38:38,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 09:38:38,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:38:38,233 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,244 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,253 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:38,275 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-18 09:38:38,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-02-18 09:38:38,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:38,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-02-18 09:38:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:38,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:38,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:38:38,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-18 09:38:38,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:38,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:38:38,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:38:38,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:38,620 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-02-18 09:38:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:38,713 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-02-18 09:38:38,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:38,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 09:38:38,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:38,718 INFO L225 Difference]: With dead ends: 25 [2019-02-18 09:38:38,718 INFO L226 Difference]: Without dead ends: 24 [2019-02-18 09:38:38,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-18 09:38:38,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-02-18 09:38:38,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-18 09:38:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-02-18 09:38:38,729 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-02-18 09:38:38,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:38,729 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-02-18 09:38:38,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:38:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-02-18 09:38:38,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:38,730 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:38,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:38,731 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:38,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:38,731 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-02-18 09:38:38,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:38,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:38,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:38,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:38,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:38,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:38,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:38,880 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:38,880 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-02-18 09:38:38,884 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:38,884 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:38,889 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:38,890 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:38,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:38,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:38,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:38,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:38,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:38,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:38,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:38,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:38,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:38:38,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:38:38,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:38:38,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:38:38,957 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,980 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,006 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:39,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:39,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:39,124 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,132 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,141 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:39,162 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-18 09:38:39,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:39,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:39,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:39,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,308 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:39,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-18 09:38:39,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:39,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-02-18 09:38:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:39,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:39,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:39,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:39,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:39,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:39,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:39,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:39,403 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-02-18 09:38:39,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:39,879 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-02-18 09:38:39,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:39,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:39,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:39,881 INFO L225 Difference]: With dead ends: 56 [2019-02-18 09:38:39,881 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 09:38:39,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:39,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 09:38:39,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-02-18 09:38:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-18 09:38:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-02-18 09:38:39,891 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-02-18 09:38:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:39,891 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-02-18 09:38:39,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-02-18 09:38:39,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:39,892 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:39,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:39,893 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:39,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:39,893 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-02-18 09:38:39,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:39,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:39,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:39,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:39,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:39,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:39,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:39,988 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:39,988 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-02-18 09:38:39,990 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:39,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:39,996 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:39,997 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:39,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:39,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:39,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:39,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:40,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:40,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:40,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:40,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:40,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:40,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:40,112 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,123 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:38:40,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:38:40,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:38:40,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:38:40,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:38:40,181 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,204 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,223 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,236 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,248 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:40,274 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-18 09:38:40,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:40,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:40,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:40,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 09:38:40,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:40,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:40,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:40,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:40,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:40,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:40,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:40,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:40,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:40,496 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-02-18 09:38:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:40,844 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-02-18 09:38:40,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:40,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:40,846 INFO L225 Difference]: With dead ends: 52 [2019-02-18 09:38:40,846 INFO L226 Difference]: Without dead ends: 48 [2019-02-18 09:38:40,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-18 09:38:40,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-02-18 09:38:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-18 09:38:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-18 09:38:40,856 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-02-18 09:38:40,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:40,856 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-18 09:38:40,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:40,857 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-18 09:38:40,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:40,857 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:40,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:40,858 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:40,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:40,858 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-02-18 09:38:40,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:40,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:40,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:40,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:40,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:40,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:40,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:40,905 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:40,906 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-02-18 09:38:40,908 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:40,908 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:40,912 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:40,912 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:40,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:40,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:40,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:40,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:40,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:40,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:40,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:40,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:40,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:38:40,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:38:41,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:38:41,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:38:41,061 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,087 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,133 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:38:41,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:38:41,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:38:41,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:38:41,329 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,347 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,361 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,407 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:41,437 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-18 09:38:41,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 09:38:41,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:41,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-18 09:38:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:41,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:41,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:41,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:41,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:41,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:41,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:41,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:41,540 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-02-18 09:38:41,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:41,721 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-02-18 09:38:41,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:41,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-18 09:38:41,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:41,722 INFO L225 Difference]: With dead ends: 42 [2019-02-18 09:38:41,722 INFO L226 Difference]: Without dead ends: 41 [2019-02-18 09:38:41,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:38:41,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-18 09:38:41,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-02-18 09:38:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-18 09:38:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-18 09:38:41,730 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-02-18 09:38:41,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:41,730 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-18 09:38:41,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-18 09:38:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:41,731 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:41,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:41,731 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:41,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:41,731 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-02-18 09:38:41,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:41,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:41,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:41,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:41,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:41,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:41,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:41,811 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:41,811 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-02-18 09:38:41,812 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:41,812 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:41,818 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:41,819 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:41,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:41,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:41,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:41,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:41,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:41,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:41,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:41,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:41,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:38:41,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:38:41,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:38:41,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:38:41,929 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,975 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,014 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 09:38:42,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 09:38:42,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 09:38:42,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:38:42,202 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,217 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,233 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,250 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:42,280 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-18 09:38:42,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:38:42,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:42,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-18 09:38:42,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 09:38:42,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:42,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-18 09:38:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:42,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:42,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:42,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:42,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:42,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:42,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:42,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:42,469 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-02-18 09:38:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:42,857 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-02-18 09:38:42,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:42,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:42,859 INFO L225 Difference]: With dead ends: 54 [2019-02-18 09:38:42,859 INFO L226 Difference]: Without dead ends: 53 [2019-02-18 09:38:42,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:42,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-18 09:38:42,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-02-18 09:38:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-18 09:38:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-02-18 09:38:42,871 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-02-18 09:38:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:42,871 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-02-18 09:38:42,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-02-18 09:38:42,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:42,872 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:42,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:42,872 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:42,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:42,873 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-02-18 09:38:42,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:42,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:42,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:42,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:42,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:43,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:43,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:43,006 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:43,006 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-02-18 09:38:43,007 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:43,007 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:43,011 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:43,011 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:43,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:43,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:43,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:43,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:43,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:43,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:43,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:43,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:43,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:43,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:43,132 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,143 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:43,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:38:43,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:38:43,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:38:43,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:38:43,188 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,204 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,219 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,231 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,241 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:43,263 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-18 09:38:43,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:38:43,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:43,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:43,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:38:43,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:43,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-18 09:38:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:43,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:43,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:43,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:43,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:38:43,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:43,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:43,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:43,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:43,418 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-02-18 09:38:43,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:43,720 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-02-18 09:38:43,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:43,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:43,721 INFO L225 Difference]: With dead ends: 63 [2019-02-18 09:38:43,722 INFO L226 Difference]: Without dead ends: 61 [2019-02-18 09:38:43,722 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-02-18 09:38:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-18 09:38:43,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-02-18 09:38:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-18 09:38:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-02-18 09:38:43,733 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-02-18 09:38:43,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:43,733 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-02-18 09:38:43,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:43,733 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-02-18 09:38:43,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:43,734 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:43,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:43,734 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:43,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:43,735 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-02-18 09:38:43,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:43,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:43,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:43,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:43,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:43,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:38:43,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 09:38:43,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:43,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:38:43,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:38:43,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:38:43,786 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-02-18 09:38:43,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:43,905 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-02-18 09:38:43,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:43,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 09:38:43,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:43,907 INFO L225 Difference]: With dead ends: 41 [2019-02-18 09:38:43,907 INFO L226 Difference]: Without dead ends: 40 [2019-02-18 09:38:43,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:38:43,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-18 09:38:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-02-18 09:38:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-18 09:38:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-02-18 09:38:43,919 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-02-18 09:38:43,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:43,919 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-02-18 09:38:43,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:38:43,920 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-02-18 09:38:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:43,920 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:43,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:43,921 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:43,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:43,921 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-02-18 09:38:43,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:43,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:43,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:43,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:44,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:44,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:44,038 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:44,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:44,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:44,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:44,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:44,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:44,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-18 09:38:44,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:44,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:44,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:38:44,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:38:44,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:38:44,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:38:44,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:38:44,113 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,141 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,167 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 09:38:44,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 09:38:44,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 09:38:44,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:38:44,365 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,382 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,399 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,415 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:44,445 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-18 09:38:44,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:38:44,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:44,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-18 09:38:45,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,092 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:45,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-02-18 09:38:45,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:45,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-02-18 09:38:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:45,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:45,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:45,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:45,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:45,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:45,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:45,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:45,186 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-02-18 09:38:45,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:45,643 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-02-18 09:38:45,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:45,644 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:45,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:45,645 INFO L225 Difference]: With dead ends: 57 [2019-02-18 09:38:45,645 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 09:38:45,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 09:38:45,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-02-18 09:38:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-18 09:38:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-02-18 09:38:45,656 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-02-18 09:38:45,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:45,656 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-02-18 09:38:45,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-02-18 09:38:45,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:45,657 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:45,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:45,657 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:45,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:45,658 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-02-18 09:38:45,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:45,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:45,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:45,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:45,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:45,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:45,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:45,933 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:45,933 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-02-18 09:38:45,934 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:45,935 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:45,939 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:45,939 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:45,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:45,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:45,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:45,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:45,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:45,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:45,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:46,134 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-02-18 09:38:46,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:46,455 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-18 09:38:46,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:46,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:46,496 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,512 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:46,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:38:46,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:38:46,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:38:46,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:38:46,602 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,623 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,637 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,648 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,658 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:46,680 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-18 09:38:46,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:38:46,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:46,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:46,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 09:38:46,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:46,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:46,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:46,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:46,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:46,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:46,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:38:46,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:46,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:46,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:46,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:46,858 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-02-18 09:38:47,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:47,254 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-02-18 09:38:47,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:47,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:47,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:47,255 INFO L225 Difference]: With dead ends: 61 [2019-02-18 09:38:47,255 INFO L226 Difference]: Without dead ends: 60 [2019-02-18 09:38:47,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:47,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-18 09:38:47,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-02-18 09:38:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-18 09:38:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-02-18 09:38:47,273 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-02-18 09:38:47,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:47,273 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-02-18 09:38:47,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-02-18 09:38:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:47,274 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:47,274 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:47,274 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:47,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:47,277 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-02-18 09:38:47,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:47,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:47,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:47,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:47,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:47,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:47,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:47,350 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:47,350 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-02-18 09:38:47,351 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:47,351 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:47,354 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:47,355 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:47,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:47,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:47,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:47,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:47,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:47,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:47,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:47,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:47,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:38:47,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:38:47,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:38:47,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:38:47,446 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,473 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,487 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,497 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:38:47,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:38:47,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:38:47,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:38:47,633 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,646 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,660 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,677 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:47,800 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-18 09:38:47,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 09:38:47,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:47,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-18 09:38:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:47,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:47,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:47,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:47,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:47,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:47,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:47,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:47,891 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-02-18 09:38:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:48,040 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-02-18 09:38:48,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:48,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-18 09:38:48,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:48,041 INFO L225 Difference]: With dead ends: 53 [2019-02-18 09:38:48,041 INFO L226 Difference]: Without dead ends: 52 [2019-02-18 09:38:48,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:38:48,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-18 09:38:48,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-02-18 09:38:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-18 09:38:48,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-02-18 09:38:48,053 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-02-18 09:38:48,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:48,054 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-02-18 09:38:48,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-02-18 09:38:48,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:48,054 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:48,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:48,055 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:48,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:48,055 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-02-18 09:38:48,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:48,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:48,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:48,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:48,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:48,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:48,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:48,138 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:48,139 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-02-18 09:38:48,140 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:48,140 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:48,144 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:48,144 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:48,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:48,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:48,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:48,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:48,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:48,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:48,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:48,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:38:48,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:38:48,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:38:48,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:38:48,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:38:48,213 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,238 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,254 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,266 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 09:38:48,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 09:38:48,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 09:38:48,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:38:48,420 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,437 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,453 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,469 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:48,536 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-18 09:38:48,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:38:48,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:48,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-18 09:38:48,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 09:38:48,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:48,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-18 09:38:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:48,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:48,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:48,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:48,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:48,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:48,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:48,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:48,757 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-02-18 09:38:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:49,287 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-02-18 09:38:49,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:49,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:49,289 INFO L225 Difference]: With dead ends: 69 [2019-02-18 09:38:49,289 INFO L226 Difference]: Without dead ends: 68 [2019-02-18 09:38:49,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:49,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-18 09:38:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-02-18 09:38:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-18 09:38:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-02-18 09:38:49,302 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-02-18 09:38:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:49,302 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-02-18 09:38:49,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:49,302 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-02-18 09:38:49,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:49,303 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:49,303 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-18 09:38:49,303 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:49,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:49,304 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-02-18 09:38:49,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:49,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:49,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:49,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:49,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:49,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:49,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:49,377 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:49,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:49,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:49,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:49,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:49,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:49,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:38:49,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:49,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:49,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:49,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:38:49,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:38:49,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:38:49,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:38:49,507 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:49,701 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:49,717 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:49,730 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:49,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:49,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 09:38:49,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 09:38:49,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 09:38:49,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:38:49,949 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:49,967 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:49,982 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:49,999 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:50,030 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-02-18 09:38:50,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:38:50,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:50,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-18 09:38:50,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 78 [2019-02-18 09:38:50,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:50,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:50 [2019-02-18 09:38:50,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-18 09:38:50,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:50,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-18 09:38:50,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-02-18 09:38:50,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:50,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:50,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-18 09:38:50,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:50,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:38:50,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:38:50,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:38:50,271 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-02-18 09:38:50,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:50,601 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-02-18 09:38:50,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:50,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-18 09:38:50,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:50,602 INFO L225 Difference]: With dead ends: 73 [2019-02-18 09:38:50,602 INFO L226 Difference]: Without dead ends: 71 [2019-02-18 09:38:50,603 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-02-18 09:38:50,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-18 09:38:50,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-02-18 09:38:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-18 09:38:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-02-18 09:38:50,616 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-02-18 09:38:50,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:50,616 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-02-18 09:38:50,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:38:50,616 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-02-18 09:38:50,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:50,617 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:50,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:50,617 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:50,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:50,618 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-02-18 09:38:50,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:50,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:50,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:50,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:50,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:50,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:50,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:50,696 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:50,696 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-02-18 09:38:50,698 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:50,698 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:50,701 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:50,702 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:50,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:50,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:50,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:50,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:50,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:50,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:50,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:50,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:50,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:38:50,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:38:50,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:38:50,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:38:50,823 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,850 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,875 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:38:50,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:38:50,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:38:50,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:38:51,002 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,016 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,031 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,047 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:51,076 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:38:51,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-18 09:38:51,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:51,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 09:38:51,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-02-18 09:38:51,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:51,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-02-18 09:38:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:51,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:51,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:51,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:38:51,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:51,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:51,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:51,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:51,319 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-02-18 09:38:51,741 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-02-18 09:38:51,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:51,956 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-02-18 09:38:51,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:51,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:51,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:51,959 INFO L225 Difference]: With dead ends: 84 [2019-02-18 09:38:51,959 INFO L226 Difference]: Without dead ends: 78 [2019-02-18 09:38:51,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:38:51,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-18 09:38:51,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-02-18 09:38:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-18 09:38:51,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-02-18 09:38:51,974 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-02-18 09:38:51,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:51,975 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-02-18 09:38:51,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:51,975 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-02-18 09:38:51,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:51,975 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:51,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:51,976 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:51,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-02-18 09:38:51,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:51,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:51,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:52,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:52,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:52,156 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:52,156 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-02-18 09:38:52,158 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:52,159 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:52,164 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:52,165 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:38:52,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:52,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:52,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:52,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:52,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:52,174 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:52,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:52,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:52,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:38:52,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:38:52,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:38:52,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:38:52,310 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,339 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,367 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:52,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:52,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:52,483 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,494 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,503 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:52,525 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-18 09:38:52,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-02-18 09:38:52,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:38:52,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 09:38:52,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:74 [2019-02-18 09:38:53,165 WARN L181 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-02-18 09:38:53,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,481 INFO L303 Elim1Store]: Index analysis took 310 ms [2019-02-18 09:38:53,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-02-18 09:38:53,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-18 09:38:55,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,221 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:55,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-02-18 09:38:55,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-18 09:38:55,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-02-18 09:38:55,480 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-02-18 09:38:55,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,529 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:55,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 86 [2019-02-18 09:38:55,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-18 09:38:55,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,760 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:55,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-02-18 09:38:55,761 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,850 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:55,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-02-18 09:38:55,851 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-18 09:38:55,919 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:121 [2019-02-18 09:38:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:56,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:56,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:56,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:38:56,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:56,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:56,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:56,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:56,098 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-02-18 09:38:56,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:56,932 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-02-18 09:38:56,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:38:56,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:38:56,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:56,934 INFO L225 Difference]: With dead ends: 109 [2019-02-18 09:38:56,934 INFO L226 Difference]: Without dead ends: 107 [2019-02-18 09:38:56,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:38:56,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-18 09:38:56,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-02-18 09:38:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-18 09:38:56,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-02-18 09:38:56,950 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-02-18 09:38:56,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:56,950 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-02-18 09:38:56,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:56,950 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-02-18 09:38:56,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:56,951 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:56,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:56,951 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:56,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:56,951 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-02-18 09:38:56,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:56,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:56,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:56,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:56,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:57,287 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-02-18 09:38:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:57,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:57,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:57,343 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:57,343 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-02-18 09:38:57,344 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:57,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:57,349 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:57,349 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:57,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:57,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:57,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:57,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:57,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:57,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:57,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:57,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:38:57,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:38:57,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:38:57,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:38:57,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:38:57,412 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,440 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,454 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,466 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:57,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:57,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:57,558 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,568 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,575 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:57,597 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-18 09:38:57,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:57,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:57,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:57,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:38:57,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:57,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:57,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:57,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:57,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:57,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:57,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:57,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:57,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:57,826 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-02-18 09:38:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:58,176 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-02-18 09:38:58,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:58,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:58,178 INFO L225 Difference]: With dead ends: 77 [2019-02-18 09:38:58,178 INFO L226 Difference]: Without dead ends: 76 [2019-02-18 09:38:58,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-18 09:38:58,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-02-18 09:38:58,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-18 09:38:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-02-18 09:38:58,196 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-02-18 09:38:58,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:58,197 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-02-18 09:38:58,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:58,197 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-02-18 09:38:58,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:58,198 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:58,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:58,198 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:58,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:58,198 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-02-18 09:38:58,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:58,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:58,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:58,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:58,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:58,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:58,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:58,312 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:58,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:58,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:58,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:58,321 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:58,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:58,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:38:58,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:58,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:58,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 09:38:58,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 09:38:58,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 09:38:58,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:38:58,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,505 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:58,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:38:58,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:38:58,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:38:58,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:38:58,561 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,585 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,599 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,611 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,621 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:58,652 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-18 09:38:58,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:38:58,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:58,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-18 09:38:58,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,737 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:58,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-02-18 09:38:58,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:58,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-02-18 09:38:58,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-02-18 09:38:58,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:58,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-18 09:38:58,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:58,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:58,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:58,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:38:58,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:58,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:58,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:58,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:58,939 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-02-18 09:38:59,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:59,471 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-02-18 09:38:59,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:59,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:38:59,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:59,476 INFO L225 Difference]: With dead ends: 88 [2019-02-18 09:38:59,476 INFO L226 Difference]: Without dead ends: 83 [2019-02-18 09:38:59,476 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-02-18 09:38:59,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-18 09:38:59,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-02-18 09:38:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 09:38:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-02-18 09:38:59,492 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-02-18 09:38:59,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:59,492 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-02-18 09:38:59,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:59,492 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-02-18 09:38:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:59,493 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:59,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:59,493 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:59,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:59,493 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-02-18 09:38:59,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:59,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:59,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:59,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:59,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:59,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:59,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:59,538 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:59,538 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-02-18 09:38:59,540 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:59,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:59,543 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:59,544 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:59,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:59,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:59,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:59,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:59,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:59,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:59,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:59,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:59,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:38:59,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:38:59,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:38:59,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 09:38:59,619 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,636 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,659 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 09:38:59,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 09:38:59,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:38:59,733 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,741 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,750 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:59,768 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-18 09:38:59,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:38:59,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:59,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 09:38:59,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-18 09:38:59,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:59,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-02-18 09:38:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:59,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:59,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:59,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:59,905 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:59,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:59,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:59,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:59,906 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-02-18 09:39:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:00,166 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-02-18 09:39:00,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:39:00,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:39:00,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:00,168 INFO L225 Difference]: With dead ends: 81 [2019-02-18 09:39:00,168 INFO L226 Difference]: Without dead ends: 80 [2019-02-18 09:39:00,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:00,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-18 09:39:00,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-02-18 09:39:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 09:39:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-02-18 09:39:00,183 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-02-18 09:39:00,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:00,184 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-02-18 09:39:00,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-02-18 09:39:00,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:39:00,184 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:00,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:39:00,185 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:00,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:00,185 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-02-18 09:39:00,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:00,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:00,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:00,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:00,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:00,431 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2019-02-18 09:39:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:00,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:00,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:00,487 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:39:00,488 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-02-18 09:39:00,489 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:00,489 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:00,492 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:00,492 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:00,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:00,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:00,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:00,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:00,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:00,502 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:00,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:00,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:39:00,696 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-18 09:39:00,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:39:00,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:39:00,738 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,746 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:00,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:00,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:00,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:39:00,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:39:00,784 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,803 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,816 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,827 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,838 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:00,859 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-18 09:39:00,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:39:00,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:00,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:39:00,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 09:39:00,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:00,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 09:39:01,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,029 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:01,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-02-18 09:39:01,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:01,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:01,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 09:39:01,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:01,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:01,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:01,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:39:01,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:01,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:01,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:01,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:01,156 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-02-18 09:39:01,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:01,645 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-02-18 09:39:01,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:01,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:39:01,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:01,648 INFO L225 Difference]: With dead ends: 113 [2019-02-18 09:39:01,648 INFO L226 Difference]: Without dead ends: 112 [2019-02-18 09:39:01,648 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-02-18 09:39:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-18 09:39:01,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-02-18 09:39:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-18 09:39:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-02-18 09:39:01,672 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-02-18 09:39:01,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:01,672 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-02-18 09:39:01,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-02-18 09:39:01,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:39:01,673 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:01,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:39:01,673 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:01,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:01,674 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-02-18 09:39:01,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:01,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:01,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:01,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:01,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:01,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:01,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:01,802 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:39:01,802 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-02-18 09:39:01,809 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:01,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:01,812 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:01,812 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:01,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:01,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:01,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:01,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:01,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:01,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:01,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:01,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:01,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:01,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:01,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:39:01,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:39:01,929 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:01,950 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:01,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:01,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:01,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:39:02,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:39:02,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:39:02,081 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,091 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,099 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:02,119 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-18 09:39:02,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:39:02,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-18 09:39:02,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-18 09:39:02,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:183 [2019-02-18 09:39:02,576 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2019-02-18 09:39:02,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,593 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:02,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-02-18 09:39:02,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 57 [2019-02-18 09:39:02,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-18 09:39:02,762 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-18 09:39:02,822 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:96 [2019-02-18 09:39:02,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-02-18 09:39:02,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,976 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:02,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-18 09:39:02,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:03,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-02-18 09:39:03,054 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:03,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-18 09:39:03,111 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-02-18 09:39:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:03,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:03,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:03,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-18 09:39:03,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:03,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:03,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:03,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:39:03,243 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-02-18 09:39:03,687 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 24 [2019-02-18 09:39:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:04,307 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-02-18 09:39:04,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:39:04,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:39:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:04,309 INFO L225 Difference]: With dead ends: 137 [2019-02-18 09:39:04,309 INFO L226 Difference]: Without dead ends: 136 [2019-02-18 09:39:04,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:39:04,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-18 09:39:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-02-18 09:39:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-18 09:39:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-02-18 09:39:04,341 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-02-18 09:39:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:04,341 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-02-18 09:39:04,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:04,342 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-02-18 09:39:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:39:04,342 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:04,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:39:04,343 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:04,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:04,343 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-02-18 09:39:04,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:04,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:04,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:04,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:04,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:04,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:39:04,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:04,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:04,449 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:39:04,450 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-02-18 09:39:04,450 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:04,450 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:04,453 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:04,453 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:04,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:04,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:04,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:04,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:04,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:04,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:04,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:04,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 09:39:04,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 09:39:04,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 09:39:04,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:39:04,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,654 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:04,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:04,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:04,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:39:04,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:39:04,709 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,733 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,747 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,758 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,768 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:04,799 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-18 09:39:04,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:39:04,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:04,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-18 09:39:04,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,899 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:04,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 09:39:04,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:04,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-02-18 09:39:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:04,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:04,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:04,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:04,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:04,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:04,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:04,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:04,989 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-02-18 09:39:05,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:05,426 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-02-18 09:39:05,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:39:05,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:39:05,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:05,429 INFO L225 Difference]: With dead ends: 120 [2019-02-18 09:39:05,429 INFO L226 Difference]: Without dead ends: 119 [2019-02-18 09:39:05,430 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-02-18 09:39:05,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-18 09:39:05,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-02-18 09:39:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-18 09:39:05,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-02-18 09:39:05,471 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-02-18 09:39:05,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:05,472 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-02-18 09:39:05,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:05,472 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-02-18 09:39:05,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:39:05,472 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:05,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:39:05,473 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:05,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:05,473 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-02-18 09:39:05,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:05,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:05,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:05,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:05,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:05,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:05,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:05,548 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:39:05,548 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-02-18 09:39:05,551 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:05,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:05,557 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:05,558 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:39:05,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:05,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:05,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:05,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:05,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:05,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:05,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:05,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:05,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:39:05,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:39:05,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:39:05,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:39:05,621 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:05,645 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:05,660 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:05,670 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:05,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:05,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:39:05,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:39:05,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:39:05,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:39:05,805 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:05,819 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:05,833 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:05,850 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:05,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:05,878 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-18 09:39:05,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 09:39:05,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:05,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:05,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-18 09:39:06,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:06,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:06,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:39:06,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-18 09:39:06,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:39:06,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:39:06,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:39:06,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:39:06,089 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-02-18 09:39:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:06,238 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-02-18 09:39:06,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:39:06,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-18 09:39:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:06,240 INFO L225 Difference]: With dead ends: 105 [2019-02-18 09:39:06,240 INFO L226 Difference]: Without dead ends: 104 [2019-02-18 09:39:06,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:39:06,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-18 09:39:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-02-18 09:39:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-18 09:39:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-02-18 09:39:06,285 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-02-18 09:39:06,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:06,285 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-02-18 09:39:06,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:39:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-02-18 09:39:06,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:39:06,286 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:06,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:39:06,287 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:06,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:06,287 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-02-18 09:39:06,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:06,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:06,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:06,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:06,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:06,879 WARN L181 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-02-18 09:39:07,275 WARN L181 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-02-18 09:39:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:07,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:07,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:07,304 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:07,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:39:07,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:07,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:07,313 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:39:07,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:39:07,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:39:07,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:07,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:07,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:39:07,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:07,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:07,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:39:07,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:39:07,374 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,401 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,437 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:39:07,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:39:07,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:39:07,619 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,634 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,650 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:07,674 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-18 09:39:07,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:39:07,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-18 09:39:07,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-02-18 09:39:07,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:183 [2019-02-18 09:39:08,067 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-02-18 09:39:08,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 61 [2019-02-18 09:39:08,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-18 09:39:08,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-18 09:39:08,266 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,341 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:08,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-02-18 09:39:08,343 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-02-18 09:39:08,403 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:173, output treesize:121 [2019-02-18 09:39:08,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2019-02-18 09:39:08,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,560 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:08,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-02-18 09:39:08,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,653 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:08,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-02-18 09:39:08,654 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,742 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:08,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 72 [2019-02-18 09:39:08,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-18 09:39:08,808 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-02-18 09:39:08,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:08,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:08,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:08,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:39:08,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:08,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:08,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:08,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:08,956 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-02-18 09:39:09,366 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-02-18 09:39:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:09,683 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-02-18 09:39:09,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:09,684 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:39:09,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:09,686 INFO L225 Difference]: With dead ends: 131 [2019-02-18 09:39:09,686 INFO L226 Difference]: Without dead ends: 130 [2019-02-18 09:39:09,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:39:09,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-18 09:39:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-02-18 09:39:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-18 09:39:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-02-18 09:39:09,714 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-02-18 09:39:09,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:09,714 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-02-18 09:39:09,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:09,714 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-02-18 09:39:09,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:39:09,714 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:09,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:39:09,715 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:09,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:09,715 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-02-18 09:39:09,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:09,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:09,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:39:09,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:09,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:09,855 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-02-18 09:39:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:09,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:09,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:09,871 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:39:09,871 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-02-18 09:39:09,873 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:09,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:09,876 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:09,876 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:09,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:09,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:09,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:09,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:09,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:09,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:09,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:09,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:09,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:39:09,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:39:09,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:39:09,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:39:09,927 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:09,951 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:09,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:09,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:09,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:39:10,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:39:10,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:39:10,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:39:10,108 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,123 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,137 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,154 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:10,182 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:39:10,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 09:39:10,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:10,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 09:39:10,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,622 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:10,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 76 [2019-02-18 09:39:10,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:10,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-18 09:39:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:10,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:10,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:10,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:10,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:10,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:10,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:10,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:10,716 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-02-18 09:39:11,313 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-02-18 09:39:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:11,516 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-02-18 09:39:11,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:11,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:39:11,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:11,517 INFO L225 Difference]: With dead ends: 71 [2019-02-18 09:39:11,518 INFO L226 Difference]: Without dead ends: 68 [2019-02-18 09:39:11,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:39:11,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-18 09:39:11,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-02-18 09:39:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-18 09:39:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-02-18 09:39:11,541 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-02-18 09:39:11,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:11,541 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-02-18 09:39:11,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-02-18 09:39:11,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:39:11,542 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:11,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:39:11,542 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:11,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:11,542 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-02-18 09:39:11,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:11,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:11,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:11,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:11,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:39:11,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:11,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:11,712 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:39:11,713 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-02-18 09:39:11,714 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:11,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:11,717 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:11,717 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:11,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:11,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:11,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:11,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:11,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:11,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:11,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:11,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:39:11,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:39:11,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:39:11,813 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,822 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:11,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:11,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:11,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:39:11,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:39:11,858 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,874 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,888 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,899 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,909 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:11,931 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-18 09:39:11,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:39:11,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:11,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-18 09:39:11,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-18 09:39:11,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:12,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-18 09:39:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:12,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:12,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:12,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:39:12,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:12,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:12,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:12,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:39:12,066 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-02-18 09:39:12,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:12,335 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-02-18 09:39:12,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:39:12,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:39:12,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:12,336 INFO L225 Difference]: With dead ends: 73 [2019-02-18 09:39:12,337 INFO L226 Difference]: Without dead ends: 72 [2019-02-18 09:39:12,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:39:12,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-18 09:39:12,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-02-18 09:39:12,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-18 09:39:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-02-18 09:39:12,368 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-02-18 09:39:12,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:12,369 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-02-18 09:39:12,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:12,369 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-02-18 09:39:12,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:39:12,369 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:12,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:39:12,369 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:12,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:12,370 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-02-18 09:39:12,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:12,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:12,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:12,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:12,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:12,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:12,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:12,531 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:39:12,531 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-02-18 09:39:12,535 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:12,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:12,538 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:12,539 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:12,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:12,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:12,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:12,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:12,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:12,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:12,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:12,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:12,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:12,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:12,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:39:12,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:39:12,629 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,657 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,691 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:39:12,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:39:12,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:39:12,826 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,836 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,845 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:12,867 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-18 09:39:12,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:39:12,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:12,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:39:12,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,950 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:12,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-18 09:39:12,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:12,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-18 09:39:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:12,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:13,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:13,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-02-18 09:39:13,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:13,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:39:13,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:39:13,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:39:13,032 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-02-18 09:39:13,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:13,264 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-02-18 09:39:13,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:39:13,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-18 09:39:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:13,266 INFO L225 Difference]: With dead ends: 66 [2019-02-18 09:39:13,266 INFO L226 Difference]: Without dead ends: 65 [2019-02-18 09:39:13,267 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-02-18 09:39:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-18 09:39:13,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-02-18 09:39:13,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-18 09:39:13,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-02-18 09:39:13,295 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-02-18 09:39:13,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:13,296 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-02-18 09:39:13,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:39:13,296 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-02-18 09:39:13,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:39:13,296 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:13,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:39:13,297 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:13,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:13,297 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-02-18 09:39:13,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:13,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:13,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:13,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:13,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:13,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:39:13,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:39:13,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 09:39:13,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:39:13,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:39:13,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:39:13,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:39:13,477 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-02-18 09:39:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:13,537 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-02-18 09:39:13,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:39:13,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-18 09:39:13,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:13,539 INFO L225 Difference]: With dead ends: 54 [2019-02-18 09:39:13,539 INFO L226 Difference]: Without dead ends: 51 [2019-02-18 09:39:13,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:39:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-18 09:39:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-02-18 09:39:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-18 09:39:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-02-18 09:39:13,576 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-02-18 09:39:13,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:13,576 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-02-18 09:39:13,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:39:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-02-18 09:39:13,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:39:13,577 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:13,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:39:13,577 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:13,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:13,577 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-02-18 09:39:13,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:13,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:13,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:13,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:13,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:13,799 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-02-18 09:39:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:14,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:14,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:14,002 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:39:14,002 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-02-18 09:39:14,003 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:14,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:14,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:14,006 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:14,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:14,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:14,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:14,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:14,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:14,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:14,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:14,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 09:39:14,189 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:39:14,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 09:39:14,450 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-02-18 09:39:14,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:39:14,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:14,467 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:14,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:14,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:14,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:39:14,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:39:14,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:39:14,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 09:39:14,509 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:14,526 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:14,539 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:14,549 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:14,559 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:14,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:14,579 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-18 09:39:14,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:39:14,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:39:14,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 09:39:14,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:62 [2019-02-18 09:39:14,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-18 09:39:14,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:14,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:14,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-02-18 09:39:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:14,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:14,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:14,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:39:14,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:14,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:14,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:14,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:39:14,810 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-02-18 09:39:15,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:15,058 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-02-18 09:39:15,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:39:15,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:39:15,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:15,059 INFO L225 Difference]: With dead ends: 83 [2019-02-18 09:39:15,060 INFO L226 Difference]: Without dead ends: 82 [2019-02-18 09:39:15,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-18 09:39:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-02-18 09:39:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-18 09:39:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-02-18 09:39:15,106 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-02-18 09:39:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:15,107 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-02-18 09:39:15,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-02-18 09:39:15,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:15,108 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:15,108 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-18 09:39:15,108 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:15,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:15,108 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-02-18 09:39:15,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:15,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:15,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:15,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:15,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:15,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:39:15,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:15,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:15,265 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:15,266 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-02-18 09:39:15,266 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:15,266 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:15,268 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:15,269 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:39:15,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:15,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:15,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:15,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:15,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:15,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:15,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:15,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 09:39:15,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 09:39:15,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:39:15,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:15,355 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:15,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:15,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:39:15,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:39:15,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:39:15,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:39:15,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 09:39:15,403 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:15,419 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:15,434 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:15,445 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:15,462 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:15,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:15,480 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-18 09:39:15,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:39:15,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:15,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:15,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 09:39:15,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2019-02-18 09:39:15,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:15,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:15,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:20 [2019-02-18 09:39:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:15,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:15,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:15,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:39:15,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:15,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:15,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:15,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:39:15,605 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-02-18 09:39:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:16,035 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-02-18 09:39:16,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:16,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:39:16,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:16,037 INFO L225 Difference]: With dead ends: 86 [2019-02-18 09:39:16,037 INFO L226 Difference]: Without dead ends: 85 [2019-02-18 09:39:16,037 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-02-18 09:39:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-18 09:39:16,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-02-18 09:39:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-18 09:39:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-02-18 09:39:16,097 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-02-18 09:39:16,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:16,098 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-02-18 09:39:16,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-02-18 09:39:16,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:16,099 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:16,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:16,099 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:16,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:16,099 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-02-18 09:39:16,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:16,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:16,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:16,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:16,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:16,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:39:16,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:16,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:16,266 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:16,267 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-02-18 09:39:16,267 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:16,268 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:16,271 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:16,272 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:16,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:16,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:16,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:16,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:16,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:16,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:16,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:16,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 09:39:16,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 09:39:16,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 09:39:16,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:39:16,445 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:16,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:16,479 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:16,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:16,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:16,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:16,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:16,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:39:16,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:39:16,530 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:16,555 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:16,569 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:16,580 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:16,591 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:16,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:16,622 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-18 09:39:16,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:39:16,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:16,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:16,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-18 09:39:16,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-18 09:39:16,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:16,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:16,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-18 09:39:16,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,798 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:16,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-18 09:39:16,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:16,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:16,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-18 09:39:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:16,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:17,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:17,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:39:17,063 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:17,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:17,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:17,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:39:17,064 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-02-18 09:39:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:17,602 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-02-18 09:39:17,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:17,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:39:17,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:17,603 INFO L225 Difference]: With dead ends: 100 [2019-02-18 09:39:17,603 INFO L226 Difference]: Without dead ends: 99 [2019-02-18 09:39:17,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:17,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-18 09:39:17,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-02-18 09:39:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-18 09:39:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-02-18 09:39:17,684 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-02-18 09:39:17,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:17,684 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-02-18 09:39:17,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:17,685 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-02-18 09:39:17,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:17,685 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:17,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:17,685 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:17,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:17,685 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-02-18 09:39:17,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:17,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:17,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:17,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:17,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:17,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:17,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:17,787 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:17,787 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-02-18 09:39:17,787 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:17,788 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:17,790 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:17,790 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:17,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:17,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:17,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:17,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:17,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:17,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:17,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:17,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:39:17,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:39:17,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:39:17,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:39:17,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:17,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:18,006 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:18,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:18,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:39:18,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:39:18,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:39:18,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:39:18,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:39:18,089 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:18,112 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:18,124 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:18,135 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:18,145 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:18,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:18,173 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 09:39:18,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:39:18,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:18,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:18,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:39:18,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:39:18,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:18,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:18,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 09:39:18,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,313 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:18,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 09:39:18,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:18,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:18,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 09:39:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:18,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:18,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:18,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:39:18,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:18,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:18,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:18,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:39:18,415 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-02-18 09:39:18,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:18,903 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-02-18 09:39:18,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:18,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:39:18,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:18,905 INFO L225 Difference]: With dead ends: 104 [2019-02-18 09:39:18,906 INFO L226 Difference]: Without dead ends: 103 [2019-02-18 09:39:18,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:18,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-18 09:39:19,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-02-18 09:39:19,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-18 09:39:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-02-18 09:39:19,003 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-02-18 09:39:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:19,004 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-02-18 09:39:19,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-02-18 09:39:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:19,004 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:19,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:19,005 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:19,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:19,005 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-02-18 09:39:19,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:19,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:19,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:19,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:19,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:39:19,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:19,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:19,064 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:19,064 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-02-18 09:39:19,065 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:19,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:19,067 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:19,068 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:19,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:19,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:19,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:19,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:19,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:19,077 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:19,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:19,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:39:19,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:39:19,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:39:19,179 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:19,190 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:19,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:19,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:19,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:19,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:19,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:39:19,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:39:19,232 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:19,249 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:19,263 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:19,274 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:19,284 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:19,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:19,306 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-18 09:39:19,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:39:19,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:19,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:19,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:39:19,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:39:19,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:19,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:19,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 09:39:19,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,456 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:19,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 09:39:19,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:19,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:19,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 09:39:19,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:19,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:19,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:19,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:19,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:39:19,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:19,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:19,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:19,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:39:19,568 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-02-18 09:39:20,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:20,142 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-02-18 09:39:20,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:20,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:39:20,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:20,144 INFO L225 Difference]: With dead ends: 107 [2019-02-18 09:39:20,145 INFO L226 Difference]: Without dead ends: 106 [2019-02-18 09:39:20,145 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-02-18 09:39:20,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-18 09:39:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-02-18 09:39:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-18 09:39:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-02-18 09:39:20,254 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-02-18 09:39:20,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:20,255 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-02-18 09:39:20,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-02-18 09:39:20,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:20,255 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:20,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:20,256 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:20,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:20,256 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-02-18 09:39:20,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:20,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:20,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:20,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:20,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:20,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:20,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:20,413 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:20,413 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-02-18 09:39:20,414 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:20,414 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:20,417 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:20,417 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:20,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:20,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:20,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:20,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:20,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:20,428 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:20,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:20,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:20,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:39:20,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:39:20,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:39:20,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:39:20,488 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,512 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,538 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:39:20,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:39:20,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:39:20,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:39:20,672 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,687 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,701 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,717 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:20,747 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:39:20,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:39:20,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:20,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:39:20,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:39:20,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:20,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-18 09:39:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:20,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:20,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:20,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:20,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:20,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:20,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:20,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:20,937 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-02-18 09:39:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:21,315 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-02-18 09:39:21,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:39:21,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:39:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:21,317 INFO L225 Difference]: With dead ends: 100 [2019-02-18 09:39:21,318 INFO L226 Difference]: Without dead ends: 98 [2019-02-18 09:39:21,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:21,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-18 09:39:21,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-02-18 09:39:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-18 09:39:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-02-18 09:39:21,435 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-02-18 09:39:21,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:21,435 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-02-18 09:39:21,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:21,435 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-02-18 09:39:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:21,435 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:21,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:21,436 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:21,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:21,436 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-02-18 09:39:21,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:21,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:21,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:21,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:21,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:21,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:21,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:21,542 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:21,542 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-02-18 09:39:21,543 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:21,543 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:21,545 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:21,546 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:21,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:21,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:21,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:21,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:21,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:21,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:21,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:21,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:39:21,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:39:21,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:39:21,646 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:21,661 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:21,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:21,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:21,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:21,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:21,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:39:21,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:39:21,706 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:21,724 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:21,738 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:21,750 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:21,760 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:21,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:21,782 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-18 09:39:21,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:39:21,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-18 09:39:22,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-18 09:39:22,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:183 [2019-02-18 09:39:22,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,120 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:22,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 67 [2019-02-18 09:39:22,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 61 [2019-02-18 09:39:22,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,271 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:22,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-02-18 09:39:22,273 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-18 09:39:22,327 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:92 [2019-02-18 09:39:22,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 65 [2019-02-18 09:39:22,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-18 09:39:22,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,520 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:22,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-02-18 09:39:22,521 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-18 09:39:22,567 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:84 [2019-02-18 09:39:22,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:22,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:22,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:22,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:39:22,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:22,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:22,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:22,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:39:22,711 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-02-18 09:39:23,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:23,789 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-02-18 09:39:23,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:39:23,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:39:23,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:23,791 INFO L225 Difference]: With dead ends: 124 [2019-02-18 09:39:23,792 INFO L226 Difference]: Without dead ends: 123 [2019-02-18 09:39:23,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:39:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-18 09:39:23,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-02-18 09:39:23,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-18 09:39:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-02-18 09:39:23,907 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-02-18 09:39:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:23,907 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-02-18 09:39:23,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-02-18 09:39:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:23,908 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:23,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:23,908 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:23,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:23,908 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-02-18 09:39:23,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:23,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:23,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:23,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:23,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:24,060 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-18 09:39:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:39:24,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:24,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:24,379 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:24,379 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-02-18 09:39:24,380 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:24,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:24,382 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:24,382 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:24,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:24,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:24,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:24,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:24,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:24,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:24,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:24,532 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-02-18 09:39:24,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:24,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:24,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:24,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:39:24,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:39:24,559 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:24,588 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:24,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:24,618 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:24,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:24,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 09:39:24,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 09:39:24,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 09:39:24,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:39:24,783 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:24,800 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:24,816 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:24,832 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:24,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:24,864 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-18 09:39:24,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:39:24,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:24,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:24,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-18 09:39:24,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,958 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:24,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 09:39:24,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:24,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:24,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-18 09:39:25,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:25,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:25,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:25,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:25,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:25,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:25,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:25,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:25,024 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:25,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 09:39:25,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:25,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:25,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:39:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:25,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:25,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:25,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 09:39:25,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:25,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:39:25,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:39:25,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:25,131 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-02-18 09:39:25,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:25,676 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-02-18 09:39:25,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:25,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-18 09:39:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:25,678 INFO L225 Difference]: With dead ends: 114 [2019-02-18 09:39:25,678 INFO L226 Difference]: Without dead ends: 113 [2019-02-18 09:39:25,678 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-02-18 09:39:25,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-18 09:39:25,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-02-18 09:39:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-18 09:39:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-02-18 09:39:25,806 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-02-18 09:39:25,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:25,806 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-02-18 09:39:25,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:39:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-02-18 09:39:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:25,807 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:25,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:25,807 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:25,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:25,807 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-02-18 09:39:25,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:25,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:25,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:25,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:25,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:25,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:25,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:25,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:25,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:39:25,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:25,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:25,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:39:25,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:39:25,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:39:25,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:25,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:25,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:39:25,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:25,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:25,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:25,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:25,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:25,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:25,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:25,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:39:25,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:25,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:25,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:25,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:25,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:39:25,978 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:26,007 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:26,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:26,036 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:26,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:26,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 09:39:26,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 09:39:26,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 09:39:26,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:39:26,195 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:26,212 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:26,228 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:26,245 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:26,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:26,276 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-18 09:39:26,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:39:26,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:26,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:26,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-18 09:39:26,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 09:39:26,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:26,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:26,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-18 09:39:26,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,419 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:26,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-18 09:39:26,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:26,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:26,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-18 09:39:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:26,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:26,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:26,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:39:26,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:26,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:26,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:26,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:26,522 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-02-18 09:39:27,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:27,109 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-02-18 09:39:27,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:39:27,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:39:27,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:27,111 INFO L225 Difference]: With dead ends: 164 [2019-02-18 09:39:27,112 INFO L226 Difference]: Without dead ends: 163 [2019-02-18 09:39:27,112 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-02-18 09:39:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-18 09:39:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-02-18 09:39:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-18 09:39:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-02-18 09:39:27,333 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-02-18 09:39:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:27,333 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-02-18 09:39:27,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-02-18 09:39:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:27,334 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:27,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:27,334 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:27,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:27,334 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-02-18 09:39:27,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:27,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:27,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:39:27,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:27,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:39:27,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:27,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:27,381 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:27,381 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-02-18 09:39:27,382 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:27,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:27,384 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:27,384 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:27,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:27,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:27,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:27,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:27,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:27,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:27,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:27,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:39:27,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:39:27,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:39:27,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:39:27,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:27,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:27,546 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:27,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:27,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:27,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:39:27,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:39:27,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:39:27,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:39:27,597 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:27,620 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:27,633 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:27,643 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:27,653 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:27,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:27,680 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:39:27,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 09:39:27,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:27,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:27,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 09:39:27,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 09:39:27,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:39:27,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 09:39:27,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-18 09:39:27,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-02-18 09:39:27,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:28,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:28,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:28,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:28,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:28,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:28,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:28,032 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-02-18 09:39:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:28,534 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-02-18 09:39:28,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:39:28,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:39:28,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:28,537 INFO L225 Difference]: With dead ends: 160 [2019-02-18 09:39:28,537 INFO L226 Difference]: Without dead ends: 159 [2019-02-18 09:39:28,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:28,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-18 09:39:28,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-02-18 09:39:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-18 09:39:28,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-02-18 09:39:28,813 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-02-18 09:39:28,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:28,814 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-02-18 09:39:28,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:28,814 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-02-18 09:39:28,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:28,815 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:28,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:28,815 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:28,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:28,815 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-02-18 09:39:28,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:28,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:28,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:28,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:28,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:39:28,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:28,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:28,881 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:28,881 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-02-18 09:39:28,882 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:28,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:28,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:28,885 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:28,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:28,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:28,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:28,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:28,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:28,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:28,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:28,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:28,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:39:28,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:39:28,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:39:28,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 09:39:28,942 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:28,958 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:28,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:28,983 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:28,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:29,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 09:39:29,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:29,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:29,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 09:39:29,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:29,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:29,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:29,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:29,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:39:29,056 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:29,065 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:29,074 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:29,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:29,094 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-18 09:39:29,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:29,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 09:39:29,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:29,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:29,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 09:39:29,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:29,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:29,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:29,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:29,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:29,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-18 09:39:29,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:29,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:29,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-02-18 09:39:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:29,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:29,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:29,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:39:29,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:29,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:29,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:29,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:39:29,229 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-02-18 09:39:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:30,052 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-02-18 09:39:30,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:30,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:39:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:30,055 INFO L225 Difference]: With dead ends: 175 [2019-02-18 09:39:30,055 INFO L226 Difference]: Without dead ends: 174 [2019-02-18 09:39:30,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:39:30,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-02-18 09:39:30,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-02-18 09:39:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-18 09:39:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-02-18 09:39:30,476 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-02-18 09:39:30,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:30,477 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-02-18 09:39:30,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-02-18 09:39:30,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:30,478 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:30,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:30,478 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:30,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:30,478 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-02-18 09:39:30,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:30,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:30,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:30,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:30,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:39:30,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:39:30,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-18 09:39:30,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:39:30,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 09:39:30,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 09:39:30,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-18 09:39:30,579 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-02-18 09:39:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:30,955 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-02-18 09:39:30,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:39:30,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-02-18 09:39:30,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:30,957 INFO L225 Difference]: With dead ends: 185 [2019-02-18 09:39:30,957 INFO L226 Difference]: Without dead ends: 184 [2019-02-18 09:39:30,957 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-02-18 09:39:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-02-18 09:39:31,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-02-18 09:39:31,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-18 09:39:31,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-02-18 09:39:31,186 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-02-18 09:39:31,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:31,186 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-02-18 09:39:31,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 09:39:31,186 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-02-18 09:39:31,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:31,187 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:31,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:31,187 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:31,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:31,188 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-02-18 09:39:31,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:31,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:31,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:31,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:31,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:39:31,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:31,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:31,242 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:31,242 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-02-18 09:39:31,243 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:31,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:31,244 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:31,244 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:31,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:31,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:31,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:31,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:31,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:31,253 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:31,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:31,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 09:39:31,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 09:39:31,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:39:31,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:31,323 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:31,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:31,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:31,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:39:31,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:39:31,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:39:31,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 09:39:31,361 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:31,378 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:31,390 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:31,400 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:31,410 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:31,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:31,430 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-18 09:39:31,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 09:39:31,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:31,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:31,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 09:39:31,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,487 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:31,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-02-18 09:39:31,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:31,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:31,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:39:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:31,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:31,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:31,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:31,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:31,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:31,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:31,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:31,556 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-02-18 09:39:32,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:32,036 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-02-18 09:39:32,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:39:32,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:39:32,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:32,039 INFO L225 Difference]: With dead ends: 142 [2019-02-18 09:39:32,039 INFO L226 Difference]: Without dead ends: 141 [2019-02-18 09:39:32,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:32,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-02-18 09:39:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-02-18 09:39:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-02-18 09:39:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-02-18 09:39:32,269 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-02-18 09:39:32,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:32,269 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-02-18 09:39:32,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-02-18 09:39:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:32,270 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:32,270 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-18 09:39:32,270 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:32,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:32,271 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-02-18 09:39:32,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:32,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:32,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:32,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:32,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:39:32,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:32,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:32,320 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:32,320 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-02-18 09:39:32,321 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:32,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:32,323 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:32,324 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:32,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:32,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:32,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:32,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:32,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:32,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:32,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:32,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:32,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:39:32,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:39:32,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:39:32,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,479 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-02-18 09:39:32,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:39:32,480 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:32,583 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:32,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:32,608 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:32,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:32,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:39:32,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:39:32,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:39:32,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:39:32,744 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:32,759 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:32,774 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:32,787 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:32,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:32,814 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-18 09:39:32,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:32,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:39:32,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:39:32,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:39:32,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-02-18 09:39:33,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:39:33,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:33,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:33,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-02-18 09:39:33,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-18 09:39:33,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:33,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:33,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 09:39:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:33,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:33,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:33,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-18 09:39:33,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:33,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:39:33,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:39:33,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:39:33,223 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-02-18 09:39:33,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:33,963 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-02-18 09:39:33,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:33,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-18 09:39:33,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:33,966 INFO L225 Difference]: With dead ends: 219 [2019-02-18 09:39:33,967 INFO L226 Difference]: Without dead ends: 216 [2019-02-18 09:39:33,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:33,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-02-18 09:39:34,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-02-18 09:39:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-02-18 09:39:34,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-02-18 09:39:34,264 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-02-18 09:39:34,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:34,265 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-02-18 09:39:34,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:39:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-02-18 09:39:34,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:34,265 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:34,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:34,265 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:34,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:34,266 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-02-18 09:39:34,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:34,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:34,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:34,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:34,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:39:34,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:34,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:34,341 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:34,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:39:34,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:34,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:34,352 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:39:34,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:39:34,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:39:34,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:34,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:34,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:39:34,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:39:34,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:39:34,443 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:34,457 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:34,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:34,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:34,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:34,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:34,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:39:34,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:39:34,497 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:34,514 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:34,528 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:34,539 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:34,549 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:34,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:34,571 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-18 09:39:34,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-02-18 09:39:34,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:39:34,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-02-18 09:39:34,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:75 [2019-02-18 09:39:34,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 80 [2019-02-18 09:39:34,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:39:34,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 74 [2019-02-18 09:39:34,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:34,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-02-18 09:39:34,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-02-18 09:39:34,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,004 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:35,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 88 [2019-02-18 09:39:35,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-02-18 09:39:35,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,189 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:35,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-02-18 09:39:35,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:35,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-02-18 09:39:35,299 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:35,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-18 09:39:35,394 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-02-18 09:39:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:35,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:35,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:35,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:39:35,572 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:35,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:35,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:35,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:39:35,573 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-02-18 09:39:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:36,750 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-02-18 09:39:36,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:36,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:39:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:36,754 INFO L225 Difference]: With dead ends: 218 [2019-02-18 09:39:36,754 INFO L226 Difference]: Without dead ends: 215 [2019-02-18 09:39:36,754 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-02-18 09:39:36,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-18 09:39:37,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-02-18 09:39:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-18 09:39:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-02-18 09:39:37,105 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-02-18 09:39:37,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:37,105 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-02-18 09:39:37,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-02-18 09:39:37,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:37,106 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:37,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:37,106 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:37,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:37,106 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-02-18 09:39:37,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:37,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:37,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:39:37,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:37,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:37,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:37,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:37,158 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:37,158 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-02-18 09:39:37,159 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:37,159 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:37,161 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:37,161 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:37,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:37,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:37,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:37,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:37,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:37,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:37,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:37,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:39:37,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:39:37,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:39:37,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:39:37,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:37,306 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:37,320 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:37,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:37,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:37,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:39:37,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:39:37,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:39:37,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:39:37,374 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:37,720 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:37,789 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:37,798 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:37,808 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:37,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:37,838 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-18 09:39:37,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 09:39:37,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:37,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:37,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 09:39:37,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-02-18 09:39:37,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:37,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:37,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-02-18 09:39:37,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:37,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:37,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:37,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:39:37,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:38,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:38,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:38,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:39:38,000 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-02-18 09:39:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:38,818 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-02-18 09:39:38,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:39:38,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:39:38,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:38,821 INFO L225 Difference]: With dead ends: 274 [2019-02-18 09:39:38,821 INFO L226 Difference]: Without dead ends: 269 [2019-02-18 09:39:38,821 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-02-18 09:39:38,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-02-18 09:39:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-02-18 09:39:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-18 09:39:39,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-02-18 09:39:39,319 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-02-18 09:39:39,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:39,319 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-02-18 09:39:39,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-02-18 09:39:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:39,321 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:39,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:39,321 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:39,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:39,321 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-02-18 09:39:39,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:39,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:39,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:39,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:39,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:39,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:39,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:39,487 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:39,487 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-02-18 09:39:39,488 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:39,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:39,490 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:39,490 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:39,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:39,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:39,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:39,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:39,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:39,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:39,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:39,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:39,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:39:39,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:39:39,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:39:39,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:39:39,542 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:39,566 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:39,579 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:39,590 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:39,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:39,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:39:39,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:39:39,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:39:39,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:39:39,747 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:39,760 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:39,775 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:39,791 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:39,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:39,820 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:39:39,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 09:39:39,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:39,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:39,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 09:39:39,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 09:39:39,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:39:40,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:39:40,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-02-18 09:39:40,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,081 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:40,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 83 [2019-02-18 09:39:40,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:40,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:40,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-02-18 09:39:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:40,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:40,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:40,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-18 09:39:40,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:40,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:40,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:40,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:39:40,161 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-02-18 09:39:41,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:41,740 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-02-18 09:39:41,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:39:41,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:39:41,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:41,744 INFO L225 Difference]: With dead ends: 480 [2019-02-18 09:39:41,744 INFO L226 Difference]: Without dead ends: 477 [2019-02-18 09:39:41,744 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-02-18 09:39:41,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-02-18 09:39:42,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-02-18 09:39:42,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-02-18 09:39:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-02-18 09:39:42,608 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-02-18 09:39:42,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:42,608 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-02-18 09:39:42,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-02-18 09:39:42,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:39:42,609 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:42,609 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-18 09:39:42,610 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:42,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:42,610 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-02-18 09:39:42,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:42,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:42,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:42,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:42,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:42,655 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:39:42,656 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-02-18 09:39:42,656 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:42,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:42,658 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:42,658 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:39:42,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:42,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:42,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:42,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:42,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:42,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:42,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:42,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:42,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:39:42,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-18 09:39:42,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-18 09:39:42,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-18 09:39:42,741 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:42,749 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:42,759 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:42,769 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:42,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:42,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:42,789 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-02-18 09:39:42,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:42,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-18 09:39:42,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:42,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:42,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-18 09:39:42,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:42,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-02-18 09:39:42,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:42,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:42,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-02-18 09:39:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:42,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:42,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:39:42,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-02-18 09:39:42,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:39:42,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 09:39:42,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 09:39:42,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:39:42,853 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-02-18 09:39:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:44,764 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-02-18 09:39:44,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:39:44,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-18 09:39:44,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:44,771 INFO L225 Difference]: With dead ends: 804 [2019-02-18 09:39:44,771 INFO L226 Difference]: Without dead ends: 800 [2019-02-18 09:39:44,772 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-02-18 09:39:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-02-18 09:39:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-02-18 09:39:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-02-18 09:39:46,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-02-18 09:39:46,946 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-02-18 09:39:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:46,947 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-02-18 09:39:46,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 09:39:46,947 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-02-18 09:39:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:39:46,949 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:46,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:46,950 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:46,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:46,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-02-18 09:39:46,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:46,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:46,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:46,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:46,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:39:47,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:47,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:47,118 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:39:47,118 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-02-18 09:39:47,119 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:47,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:47,121 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:47,121 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:39:47,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:47,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:47,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:47,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:47,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:47,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:47,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:47,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:39:47,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:47,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:47,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:39:47,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:39:47,226 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:47,253 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:47,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:47,279 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:47,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:47,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 09:39:47,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 09:39:47,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 09:39:47,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:39:47,443 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:47,459 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:47,475 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:47,490 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:47,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:47,521 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-18 09:39:47,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:39:47,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:47,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:47,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-18 09:39:47,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-18 09:39:47,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:47,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:47,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-18 09:39:47,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,694 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:47,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-18 09:39:47,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:47,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:47,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-18 09:39:47,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,789 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:47,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-18 09:39:47,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:47,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:47,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-18 09:39:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:47,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:47,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:47,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:39:47,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:47,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:39:47,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:39:47,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:47,929 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-02-18 09:39:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:50,593 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-02-18 09:39:50,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:39:50,593 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 09:39:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:50,600 INFO L225 Difference]: With dead ends: 821 [2019-02-18 09:39:50,600 INFO L226 Difference]: Without dead ends: 820 [2019-02-18 09:39:50,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-02-18 09:39:50,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-02-18 09:39:52,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-02-18 09:39:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-02-18 09:39:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-02-18 09:39:52,570 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-02-18 09:39:52,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:52,570 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-02-18 09:39:52,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:39:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-02-18 09:39:52,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:39:52,572 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:52,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:52,572 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:52,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:52,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-02-18 09:39:52,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:52,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:52,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:52,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:52,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:52,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:52,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:52,622 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:39:52,622 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-02-18 09:39:52,623 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:52,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:52,624 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:52,624 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:52,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:52,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:52,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:52,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:52,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:52,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:52,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:52,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-02-18 09:39:52,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-18 09:39:52,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-02-18 09:39:52,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-02-18 09:39:52,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:52,694 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:52,703 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:52,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:52,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:52,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:39:52,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-18 09:39:52,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-18 09:39:52,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:39:52,752 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:52,764 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:52,774 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:52,784 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:52,794 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:52,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:52,811 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-02-18 09:39:52,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-18 09:39:52,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:52,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:52,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-18 09:39:52,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:39:52,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:52,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:52,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-18 09:39:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:52,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:52,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:52,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:52,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:52,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:52,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:52,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:52,934 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-02-18 09:39:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:55,039 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-02-18 09:39:55,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:55,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-18 09:39:55,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:55,045 INFO L225 Difference]: With dead ends: 805 [2019-02-18 09:39:55,045 INFO L226 Difference]: Without dead ends: 804 [2019-02-18 09:39:55,045 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-02-18 09:39:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-02-18 09:39:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-02-18 09:39:57,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-02-18 09:39:57,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-02-18 09:39:57,101 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-02-18 09:39:57,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:57,101 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-02-18 09:39:57,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-02-18 09:39:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:39:57,103 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:57,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:57,103 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:57,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:57,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-02-18 09:39:57,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:57,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:57,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:57,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:57,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:39:57,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:57,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:57,235 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:39:57,235 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-02-18 09:39:57,236 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:57,236 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:57,239 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:57,239 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:57,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:57,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:57,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:57,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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:57,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:57,248 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:57,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:57,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:57,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:39:57,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:39:57,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:39:57,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:39:57,291 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:57,317 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:57,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:57,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:57,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:57,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:39:57,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:39:57,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:39:57,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:39:57,492 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:57,507 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:57,522 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:57,539 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:57,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:57,569 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 09:39:57,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:39:57,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:57,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:57,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:39:57,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:39:57,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:57,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:57,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 09:39:57,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,724 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:57,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-18 09:39:57,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:57,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:57,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 09:39:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:57,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:57,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:57,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:39:57,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:57,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:57,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:57,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:57,833 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-02-18 09:40:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:00,682 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-02-18 09:40:00,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:40:00,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:40:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:00,693 INFO L225 Difference]: With dead ends: 1004 [2019-02-18 09:40:00,693 INFO L226 Difference]: Without dead ends: 1003 [2019-02-18 09:40:00,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:40:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-02-18 09:40:02,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-02-18 09:40:02,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-02-18 09:40:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-02-18 09:40:02,963 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-02-18 09:40:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:02,964 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-02-18 09:40:02,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:40:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-02-18 09:40:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:02,966 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:02,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:02,966 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:02,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:02,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-02-18 09:40:02,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:02,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:02,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:02,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:02,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:03,416 WARN L181 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-02-18 09:40:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:03,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:03,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:03,452 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:03,452 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-02-18 09:40:03,454 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:03,454 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:03,459 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:03,459 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:40:03,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:03,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:03,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:03,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:03,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:03,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:03,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:03,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 09:40:03,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 09:40:03,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:40:03,529 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:03,537 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:03,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:03,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:40:03,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:40:03,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:40:03,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:40:03,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 09:40:03,574 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:03,591 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:03,604 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:03,614 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:03,632 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:03,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:03,657 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-18 09:40:03,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-02-18 09:40:03,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:03,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:03,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-02-18 09:40:03,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:40:03,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:40:03,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:40:03,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:46 [2019-02-18 09:40:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:03,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:03,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:03,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-18 09:40:03,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:03,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:40:03,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:40:03,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:40:03,873 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-02-18 09:40:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:07,136 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-02-18 09:40:07,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:40:07,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-18 09:40:07,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:07,145 INFO L225 Difference]: With dead ends: 1213 [2019-02-18 09:40:07,146 INFO L226 Difference]: Without dead ends: 1212 [2019-02-18 09:40:07,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:40:07,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-02-18 09:40:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-02-18 09:40:10,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-02-18 09:40:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-02-18 09:40:10,054 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-02-18 09:40:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:10,055 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-02-18 09:40:10,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:40:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-02-18 09:40:10,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:10,057 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:10,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:10,057 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:10,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:10,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-02-18 09:40:10,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:10,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:10,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:10,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:10,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:10,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:10,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:10,228 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:10,229 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-02-18 09:40:10,230 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:10,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:10,232 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:10,232 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:40:10,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:10,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:10,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:10,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:10,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:10,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:10,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:10,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:40:10,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:40:10,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:40:10,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:40:10,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:40:10,308 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,336 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,364 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 09:40:10,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 09:40:10,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 09:40:10,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:40:10,533 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,550 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,566 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,582 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:10,614 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-18 09:40:10,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:40:10,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:10,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-18 09:40:10,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,743 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:10,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-02-18 09:40:10,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:10,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:42 [2019-02-18 09:40:10,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-02-18 09:40:10,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:10,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-02-18 09:40:10,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,877 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:10,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-18 09:40:10,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:10,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:10,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:11,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:11,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:40:11,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:11,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:40:11,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:40:11,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:40:11,014 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-02-18 09:40:15,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:15,392 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-02-18 09:40:15,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:40:15,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 09:40:15,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:15,408 INFO L225 Difference]: With dead ends: 1577 [2019-02-18 09:40:15,408 INFO L226 Difference]: Without dead ends: 1575 [2019-02-18 09:40:15,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:40:15,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-02-18 09:40:17,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-02-18 09:40:17,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-02-18 09:40:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-02-18 09:40:17,466 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-02-18 09:40:17,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:17,466 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-02-18 09:40:17,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:40:17,466 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-02-18 09:40:17,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:17,467 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:17,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:17,468 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:17,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-02-18 09:40:17,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:17,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:17,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:17,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:17,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:17,630 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-18 09:40:17,815 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-02-18 09:40:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:40:17,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:17,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:17,836 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:17,836 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-02-18 09:40:17,837 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:17,837 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:17,838 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:17,839 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:40:17,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:17,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:17,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:17,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:17,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:17,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:17,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:17,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:40:17,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:40:17,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:40:17,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:40:17,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:40:17,894 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:17,912 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:17,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:17,940 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:17,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:17,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:40:18,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:40:18,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:40:18,034 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:18,044 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:18,054 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:18,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:18,077 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-18 09:40:18,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:40:18,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:18,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:18,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:40:18,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,163 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:18,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-18 09:40:18,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:18,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:18,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-02-18 09:40:18,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-18 09:40:18,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:18,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:18,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-18 09:40:18,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,270 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:18,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-18 09:40:18,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:18,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:18,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-18 09:40:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:18,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:18,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:18,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-18 09:40:18,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:18,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:40:18,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:40:18,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:40:18,411 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-02-18 09:40:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:21,814 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-02-18 09:40:21,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:40:21,814 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-18 09:40:21,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:21,821 INFO L225 Difference]: With dead ends: 1108 [2019-02-18 09:40:21,821 INFO L226 Difference]: Without dead ends: 1107 [2019-02-18 09:40:21,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:40:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-02-18 09:40:24,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-02-18 09:40:24,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-02-18 09:40:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-02-18 09:40:24,711 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-02-18 09:40:24,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:24,712 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-02-18 09:40:24,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:40:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-02-18 09:40:24,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:24,714 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:24,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:24,714 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:24,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:24,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-02-18 09:40:24,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:24,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:24,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:24,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:24,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:40:24,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:24,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:24,823 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:24,823 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-02-18 09:40:24,824 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:24,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:24,826 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:24,826 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:40:24,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:24,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:24,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:24,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:24,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:24,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:24,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:24,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:40:24,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:40:24,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:40:24,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:40:24,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:40:24,885 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:24,914 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:24,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:24,939 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:24,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:24,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:40:24,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:40:25,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:25,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:25,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:25,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:25,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:40:25,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:25,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:25,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:25,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:25,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:25,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:25,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:40:25,070 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:25,086 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:25,100 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:25,118 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:25,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:25,151 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:40:25,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:25,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 09:40:25,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:25,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:25,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 09:40:25,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:25,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:25,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:25,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:25,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:25,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:25,254 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:25,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 09:40:25,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:40:25,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 09:40:25,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-18 09:40:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:25,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:25,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:25,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:40:25,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:25,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:40:25,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:40:25,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:40:25,435 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-02-18 09:40:28,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:28,402 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-02-18 09:40:28,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:40:28,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-18 09:40:28,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:28,406 INFO L225 Difference]: With dead ends: 1075 [2019-02-18 09:40:28,407 INFO L226 Difference]: Without dead ends: 1074 [2019-02-18 09:40:28,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:40:28,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-02-18 09:40:31,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-02-18 09:40:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-02-18 09:40:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-02-18 09:40:31,274 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-02-18 09:40:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:31,275 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-02-18 09:40:31,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:40:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-02-18 09:40:31,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:31,277 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:31,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:31,277 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:31,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:31,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-02-18 09:40:31,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:31,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:31,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:31,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:31,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:31,792 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-18 09:40:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:40:31,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:31,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:31,938 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:31,938 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-02-18 09:40:31,939 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:31,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:31,940 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:31,940 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:40:31,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:31,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:31,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:31,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:31,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:31,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:31,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:31,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:40:31,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:40:31,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:31,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:31,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:40:32,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:40:32,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:40:32,011 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:32,042 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:32,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:32,067 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:32,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:32,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 09:40:32,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 09:40:32,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 09:40:32,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:40:32,226 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:32,243 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:32,259 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:32,275 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:32,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:32,307 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-18 09:40:32,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:40:32,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:32,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:32,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-18 09:40:32,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,547 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:32,548 INFO L303 Elim1Store]: Index analysis took 155 ms [2019-02-18 09:40:32,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 09:40:32,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:32,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:32,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-18 09:40:32,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 09:40:32,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:32,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:32,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-02-18 09:40:32,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,980 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:32,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-18 09:40:32,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:33,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:33,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-18 09:40:33,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:33,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:33,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:33,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:40:33,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:33,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:40:33,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:40:33,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:40:33,109 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-02-18 09:40:39,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:39,225 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-02-18 09:40:39,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:40:39,225 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 09:40:39,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:39,232 INFO L225 Difference]: With dead ends: 1522 [2019-02-18 09:40:39,232 INFO L226 Difference]: Without dead ends: 1521 [2019-02-18 09:40:39,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:40:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-02-18 09:40:42,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-02-18 09:40:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-02-18 09:40:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-02-18 09:40:42,367 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-02-18 09:40:42,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:42,367 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-02-18 09:40:42,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:40:42,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-02-18 09:40:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:42,370 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:42,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:42,370 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:42,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:42,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-02-18 09:40:42,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:42,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:42,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:42,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:42,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:42,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:42,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:42,406 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:42,407 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-02-18 09:40:42,407 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:42,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:42,409 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:42,409 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:40:42,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:42,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:42,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:42,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:42,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:42,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:42,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:42,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:40:42,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:40:42,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-18 09:40:42,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-18 09:40:42,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-18 09:40:42,530 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:42,538 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:42,548 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:42,558 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:42,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:42,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:42,578 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-02-18 09:40:42,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:42,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-18 09:40:42,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:42,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:42,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-18 09:40:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:42,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:42,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:40:42,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-18 09:40:42,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:40:42,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:40:42,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:40:42,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:40:42,625 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-02-18 09:40:46,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:46,662 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-02-18 09:40:46,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:40:46,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-18 09:40:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:46,670 INFO L225 Difference]: With dead ends: 1559 [2019-02-18 09:40:46,671 INFO L226 Difference]: Without dead ends: 1554 [2019-02-18 09:40:46,671 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-02-18 09:40:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-02-18 09:40:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-02-18 09:40:51,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-02-18 09:40:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-02-18 09:40:51,051 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-02-18 09:40:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:51,051 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-02-18 09:40:51,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:40:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-02-18 09:40:51,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:51,054 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:51,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:51,054 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:51,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:51,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-02-18 09:40:51,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:51,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:51,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:51,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:51,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:40:51,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:51,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:51,112 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:51,112 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-02-18 09:40:51,113 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:51,113 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:51,115 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:51,116 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:40:51,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:51,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:51,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:51,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:51,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:51,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:51,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:51,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:40:51,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:40:51,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:40:51,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:40:51,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:40:51,170 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:51,198 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:51,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:51,223 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:51,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:51,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:40:51,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:40:51,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:40:51,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:40:51,395 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:51,409 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:51,424 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:51,441 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:51,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:51,468 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:40:51,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 09:40:51,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:51,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:51,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 09:40:51,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 09:40:51,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:40:51,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 09:40:51,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-18 09:40:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:51,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:51,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:51,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:40:51,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:51,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:40:51,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:40:51,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:40:51,751 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-02-18 09:40:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:56,129 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-02-18 09:40:56,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:40:56,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-18 09:40:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:56,140 INFO L225 Difference]: With dead ends: 1574 [2019-02-18 09:40:56,141 INFO L226 Difference]: Without dead ends: 1570 [2019-02-18 09:40:56,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:40:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-02-18 09:41:00,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-02-18 09:41:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-02-18 09:41:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-02-18 09:41:00,761 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-02-18 09:41:00,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:00,761 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-02-18 09:41:00,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:41:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-02-18 09:41:00,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:41:00,763 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:00,763 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-18 09:41:00,764 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:00,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:00,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-02-18 09:41:00,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:00,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:00,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:00,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:00,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:41:00,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:00,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:00,842 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:41:00,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:41:00,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:00,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:00,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:41:00,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:41:00,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:41:00,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:41:00,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:00,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:41:00,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:41:00,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:00,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:00,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:41:00,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:00,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:00,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:00,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:41:00,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:00,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:00,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:00,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:00,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:41:00,895 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:00,922 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:00,934 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:00,945 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:00,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:00,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:41:00,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:00,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:00,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:41:01,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:41:01,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:41:01,085 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:01,099 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:01,114 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:01,130 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:01,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:01,159 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:41:01,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 09:41:01,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:01,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:01,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-18 09:41:01,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 09:41:01,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:41:01,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 09:41:01,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-02-18 09:41:01,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,442 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:01,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 09:41:01,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:01,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:01,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-02-18 09:41:01,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-18 09:41:01,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:01,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:01,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-18 09:41:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:01,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:01,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:01,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:41:01,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:01,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:41:01,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:41:01,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:41:01,620 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-02-18 09:41:07,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:07,647 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-02-18 09:41:07,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:41:07,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-18 09:41:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:07,652 INFO L225 Difference]: With dead ends: 2098 [2019-02-18 09:41:07,653 INFO L226 Difference]: Without dead ends: 2091 [2019-02-18 09:41:07,653 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-02-18 09:41:07,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-02-18 09:41:12,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-02-18 09:41:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-02-18 09:41:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-02-18 09:41:12,921 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-02-18 09:41:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:12,921 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-02-18 09:41:12,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:41:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-02-18 09:41:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:41:12,925 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:12,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:12,925 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:12,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:12,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-02-18 09:41:12,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:12,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:12,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:41:12,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:12,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:12,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-02-18 09:41:12,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:12,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:12,971 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:41:12,971 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-02-18 09:41:12,972 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:12,972 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:12,974 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:12,974 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:41:12,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:12,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:12,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:12,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:12,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:12,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:12,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:12,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:41:12,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:41:13,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:41:13,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:41:13,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:41:13,100 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:13,129 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:13,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:13,155 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:13,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:13,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:41:13,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:41:13,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:41:13,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:41:13,317 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:13,332 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:13,347 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:13,363 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:13,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:13,406 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:41:13,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:41:13,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:13,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:13,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:41:13,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,481 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:13,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-18 09:41:13,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:13,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:13,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-18 09:41:13,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-02-18 09:41:13,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:13,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:13,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:41:13,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:13,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:41:13,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:41:13,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:41:13,609 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-02-18 09:41:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:18,689 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-02-18 09:41:18,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:41:18,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-18 09:41:18,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:18,696 INFO L225 Difference]: With dead ends: 1846 [2019-02-18 09:41:18,696 INFO L226 Difference]: Without dead ends: 1839 [2019-02-18 09:41:18,697 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-02-18 09:41:18,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-02-18 09:41:23,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-02-18 09:41:23,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-02-18 09:41:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-02-18 09:41:23,909 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-02-18 09:41:23,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:23,909 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-02-18 09:41:23,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:41:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-02-18 09:41:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:41:23,911 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:23,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:23,911 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:23,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:23,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-02-18 09:41:23,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:23,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:23,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:23,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:23,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:41:24,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:24,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:24,075 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:41:24,076 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-02-18 09:41:24,077 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:24,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:24,079 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:24,079 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:41:24,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:24,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:24,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:24,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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:24,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:24,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:24,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:24,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:41:24,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:41:24,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:41:24,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:41:24,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:41:24,126 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:24,152 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:24,166 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:24,178 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:24,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:24,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:41:24,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:41:24,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:41:24,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:41:24,319 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:24,334 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:24,349 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:24,365 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:24,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:24,394 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 09:41:24,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:41:24,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:41:24,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 09:41:24,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:96 [2019-02-18 09:41:24,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 61 [2019-02-18 09:41:24,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:24,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 78 [2019-02-18 09:41:24,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:24,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:41:24,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:64 [2019-02-18 09:41:24,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,819 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:24,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-02-18 09:41:24,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:24,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,887 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:24,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 101 [2019-02-18 09:41:24,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:24,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 09:41:24,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-02-18 09:41:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:25,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:25,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:25,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-18 09:41:25,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:25,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:41:25,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:41:25,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:41:25,151 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-02-18 09:41:27,010 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-02-18 09:41:32,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:32,087 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-02-18 09:41:32,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:41:32,088 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-18 09:41:32,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:32,092 INFO L225 Difference]: With dead ends: 2193 [2019-02-18 09:41:32,093 INFO L226 Difference]: Without dead ends: 2192 [2019-02-18 09:41:32,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:41:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-02-18 09:41:37,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-02-18 09:41:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-02-18 09:41:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-02-18 09:41:37,677 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-02-18 09:41:37,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:37,677 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-02-18 09:41:37,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:41:37,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-02-18 09:41:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:41:37,680 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:37,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:37,680 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:37,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:37,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-02-18 09:41:37,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:37,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:37,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:37,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:37,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:37,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:37,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:37,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:37,768 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:41:37,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:41:37,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:37,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:37,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:41:37,777 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:41:37,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:41:37,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:41:37,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:37,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:37,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 09:41:37,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:37,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:37,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 09:41:37,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:37,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:37,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:37,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:37,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 09:41:37,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:37,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:37,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:37,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:37,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:37,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:37,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:41:37,940 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:37,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:37,977 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:37,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:38,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:41:38,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:41:38,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:41:38,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:41:38,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:41:38,094 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:38,180 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:38,195 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:38,207 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:38,217 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:38,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:38,248 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-18 09:41:38,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:41:38,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:38,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:38,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-18 09:41:38,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 09:41:38,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:38,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:38,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-02-18 09:41:38,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,438 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:38,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-18 09:41:38,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:38,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:38,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-18 09:41:38,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,510 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:38,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-18 09:41:38,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:38,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:38,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-18 09:41:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:38,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:38,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:38,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:41:38,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:38,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:41:38,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:41:38,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:41:38,643 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-02-18 09:41:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:45,924 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-02-18 09:41:45,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:41:45,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 09:41:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:45,931 INFO L225 Difference]: With dead ends: 2526 [2019-02-18 09:41:45,931 INFO L226 Difference]: Without dead ends: 2520 [2019-02-18 09:41:45,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:41:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-02-18 09:41:51,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-02-18 09:41:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-02-18 09:41:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-02-18 09:41:51,738 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-02-18 09:41:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:51,739 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-02-18 09:41:51,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:41:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-02-18 09:41:51,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:41:51,742 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:51,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:51,742 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:51,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:51,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-02-18 09:41:51,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:51,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:51,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:41:51,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:51,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:41:51,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:51,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:51,886 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:41:51,886 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-02-18 09:41:51,887 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:51,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:51,889 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:51,889 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:41:51,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:51,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:51,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:51,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:51,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:51,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:51,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:51,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:41:51,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:41:51,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:51,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:51,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:41:51,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:51,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:51,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:51,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:41:51,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:51,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:51,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:51,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:51,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:41:51,937 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:51,971 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:51,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:51,995 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:52,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:52,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:41:52,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:52,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:52,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:41:52,149 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-02-18 09:41:52,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:52,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:52,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:52,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:52,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:41:52,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:52,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:52,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:52,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:52,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:52,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:52,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:41:52,203 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:52,219 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:52,233 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:52,250 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:52,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:52,279 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:41:52,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:52,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:41:52,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:41:52,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:41:52,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-02-18 09:41:52,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:52,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:52,456 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:52,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-18 09:41:52,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:52,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:52,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-02-18 09:41:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:52,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41: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-02-18 09:41:52,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:52,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-02-18 09:41:52,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:52,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:41:52,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:41:52,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:41:52,541 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-02-18 09:41:58,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:58,057 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-02-18 09:41:58,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:41:58,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-18 09:41:58,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:58,062 INFO L225 Difference]: With dead ends: 1971 [2019-02-18 09:41:58,062 INFO L226 Difference]: Without dead ends: 1964 [2019-02-18 09:41:58,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:41:58,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-02-18 09:42:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-02-18 09:42:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-02-18 09:42:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-02-18 09:42:03,718 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-02-18 09:42:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:03,719 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-02-18 09:42:03,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:42:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-02-18 09:42:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:42:03,723 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:03,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:03,723 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:03,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:03,723 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-02-18 09:42:03,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:03,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:03,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:03,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:03,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:42:03,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:03,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:03,781 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:42:03,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:42:03,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:03,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:03,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:42:03,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:42:03,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:42:03,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:42:03,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:03,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:42:03,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:42:03,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:03,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:03,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:42:03,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:03,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:03,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:03,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:42:03,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:03,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:03,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:03,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:03,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:42:03,837 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:03,862 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:03,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:03,883 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:03,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:03,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:42:03,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:03,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:03,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:42:03,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:03,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:03,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:03,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:03,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:42:04,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:42:04,008 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:04,021 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:04,035 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:04,050 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:04,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:04,076 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 09:42:04,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:42:04,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:04,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:04,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:42:04,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 09:42:04,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:04,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:04,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 09:42:04,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,210 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:04,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-02-18 09:42:04,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:04,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:04,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 09:42:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:42:04,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:42:04,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:04,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 09:42:04,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:04,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:42:04,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:42:04,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:42:04,307 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-02-18 09:42:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:10,111 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-02-18 09:42:10,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:42:10,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-18 09:42:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:10,116 INFO L225 Difference]: With dead ends: 2036 [2019-02-18 09:42:10,116 INFO L226 Difference]: Without dead ends: 2033 [2019-02-18 09:42:10,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:42:10,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-02-18 09:42:15,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-02-18 09:42:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-02-18 09:42:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-02-18 09:42:15,962 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-02-18 09:42:15,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:15,963 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-02-18 09:42:15,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:42:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-02-18 09:42:15,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:42:15,965 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:15,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:15,966 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:15,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:15,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-02-18 09:42:15,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:15,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:15,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:42:15,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:15,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:42:16,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:16,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:16,042 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:42:16,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:42:16,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:16,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:16,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:42:16,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:42:16,056 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:42:16,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:42:16,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:16,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:42:16,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:42:16,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:42:16,141 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:16,152 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:16,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:16,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:42:16,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:42:16,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:42:16,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:42:16,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:42:16,215 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:16,258 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:16,272 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:16,282 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:16,291 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:16,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:16,311 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-18 09:42:16,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-02-18 09:42:16,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:42:16,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-02-18 09:42:16,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:75 [2019-02-18 09:42:16,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-02-18 09:42:16,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-18 09:42:16,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,660 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:16,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2019-02-18 09:42:16,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:16,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-02-18 09:42:16,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-02-18 09:42:16,860 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-02-18 09:42:16,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2019-02-18 09:42:16,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:16,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-18 09:42:16,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:17,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,033 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:17,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-18 09:42:17,034 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:17,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,113 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:17,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 71 [2019-02-18 09:42:17,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:17,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-02-18 09:42:17,179 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-02-18 09:42:17,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,249 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:17,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2019-02-18 09:42:17,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:17,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-18 09:42:17,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:17,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,407 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:17,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-02-18 09:42:17,409 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:17,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:17,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 93 [2019-02-18 09:42:17,487 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:17,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-18 09:42:17,553 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-02-18 09:42:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:42:17,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:42:17,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:17,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:42:17,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:17,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:42:17,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:42:17,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:42:17,782 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-02-18 09:42:19,743 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-02-18 09:42:26,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:26,867 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-02-18 09:42:26,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:42:26,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-18 09:42:26,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:26,874 INFO L225 Difference]: With dead ends: 2952 [2019-02-18 09:42:26,874 INFO L226 Difference]: Without dead ends: 2951 [2019-02-18 09:42:26,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:42:26,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-02-18 09:42:32,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-02-18 09:42:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-02-18 09:42:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-02-18 09:42:32,199 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-02-18 09:42:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:32,199 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-02-18 09:42:32,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:42:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-02-18 09:42:32,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:42:32,201 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:32,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:32,201 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:32,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:32,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-02-18 09:42:32,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:32,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:32,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:42:32,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:32,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:42:32,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:32,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:32,353 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:42:32,353 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-02-18 09:42:32,354 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:42:32,354 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:42:32,356 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:42:32,356 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:42:32,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:32,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:42:32,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:32,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:32,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:32,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:42:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:32,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:32,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:42:32,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:42:32,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:42:32,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:42:32,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:32,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:32,601 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:32,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:32,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:42:32,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:42:32,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:42:32,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:42:32,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:42:32,648 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:32,669 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:32,681 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:32,690 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:32,699 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:32,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:32,726 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:42:32,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:42:32,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:42:32,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:42:32,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-02-18 09:42:32,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,911 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:32,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2019-02-18 09:42:32,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:32,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-02-18 09:42:32,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:33,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 09:42:33,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-02-18 09:42:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:42:33,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:42:33,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:33,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-02-18 09:42:33,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:33,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:42:33,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:42:33,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:42:33,121 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-02-18 09:42:33,450 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-02-18 09:42:33,621 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-02-18 09:42:33,779 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-02-18 09:42:39,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:39,349 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-02-18 09:42:39,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:42:39,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:42:39,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:39,354 INFO L225 Difference]: With dead ends: 1903 [2019-02-18 09:42:39,354 INFO L226 Difference]: Without dead ends: 1896 [2019-02-18 09:42:39,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:42:39,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-02-18 09:42:45,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-02-18 09:42:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-02-18 09:42:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-02-18 09:42:45,172 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-02-18 09:42:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:45,172 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-02-18 09:42:45,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:42:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-02-18 09:42:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:42:45,174 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:45,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:45,175 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:45,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:45,175 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-02-18 09:42:45,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:45,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:45,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:45,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:45,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:42:45,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:45,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:45,243 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:42:45,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:42:45,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:45,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:45,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:42:45,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:42:45,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-18 09:42:45,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:42:45,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:45,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:42:45,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:42:45,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:42:45,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:42:45,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:42:45,314 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:45,339 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:45,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:45,361 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:45,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:45,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:42:45,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:42:45,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:42:45,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:42:45,496 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:45,510 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:45,524 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:45,539 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:45,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:45,565 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:42:45,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 09:42:45,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:45,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:45,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 09:42:45,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,642 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:45,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 09:42:45,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:42:45,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 09:42:45,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-18 09:42:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:42:45,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:42:45,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:45,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:42:45,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:45,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:42:45,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:42:45,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:42:45,812 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-02-18 09:42:51,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:51,414 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-02-18 09:42:51,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:42:51,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-18 09:42:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:51,419 INFO L225 Difference]: With dead ends: 1884 [2019-02-18 09:42:51,419 INFO L226 Difference]: Without dead ends: 1877 [2019-02-18 09:42:51,419 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-02-18 09:42:51,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-02-18 09:42:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-02-18 09:42:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-02-18 09:42:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-02-18 09:42:57,542 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-02-18 09:42:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:57,542 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-02-18 09:42:57,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:42:57,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-02-18 09:42:57,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:42:57,545 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:57,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:57,546 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:57,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-02-18 09:42:57,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:57,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:57,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:42:57,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:57,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:42:57,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:57,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:57,665 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:42:57,665 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-02-18 09:42:57,666 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:42:57,666 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:42:57,667 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:42:57,668 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:42:57,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:57,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:42:57,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:57,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:57,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:57,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:42:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:57,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:57,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:42:57,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:57,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:57,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:42:57,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:57,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:57,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:57,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:57,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:42:57,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:57,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:57,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:57,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:57,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:57,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:57,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:42:57,794 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:57,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:57,825 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:57,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:57,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:42:57,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:42:57,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:42:57,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:42:57,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:42:57,916 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:57,938 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:57,974 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:57,983 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:57,992 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:58,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:58,019 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:42:58,277 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-18 09:42:58,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-18 09:42:58,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:58,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:58,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-18 09:42:58,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-02-18 09:42:58,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:58,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:58,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-02-18 09:42:58,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:58,393 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:58,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 94 [2019-02-18 09:42:58,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:42:58,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 09:42:58,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-02-18 09:42:58,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:42:58,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:58,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-02-18 09:42:58,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:58,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-18 09:42:58,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:58,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:42:58,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:42:58,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:42:58,590 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-02-18 09:43:07,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:43:07,443 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-02-18 09:43:07,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:43:07,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-18 09:43:07,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:43:07,451 INFO L225 Difference]: With dead ends: 2991 [2019-02-18 09:43:07,451 INFO L226 Difference]: Without dead ends: 2978 [2019-02-18 09:43:07,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:43:07,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-02-18 09:43:15,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-02-18 09:43:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-02-18 09:43:15,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-02-18 09:43:15,076 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-02-18 09:43:15,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:43:15,077 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-02-18 09:43:15,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:43:15,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-02-18 09:43:15,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:43:15,080 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:43:15,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:43:15,080 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:43:15,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:43:15,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-02-18 09:43:15,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:43:15,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:15,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:43:15,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:15,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:43:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:43:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:43:15,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:15,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:43:15,178 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:43:15,178 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-02-18 09:43:15,179 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:43:15,179 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:43:15,180 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:43:15,181 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 09:43:15,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:43:15,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:43:15,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:15,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:43:15,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:43:15,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:43:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:43:15,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:43:15,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 09:43:15,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 09:43:15,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 09:43:15,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:43:15,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,367 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:43:15,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:43:15,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:43:15,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:43:15,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:43:15,415 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,437 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,450 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,460 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,470 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,498 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-18 09:43:15,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:43:15,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:15,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-18 09:43:15,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-18 09:43:15,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:15,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-18 09:43:15,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,662 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:15,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-18 09:43:15,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:15,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-18 09:43:15,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,745 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:15,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-02-18 09:43:15,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:15,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-02-18 09:43:15,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,815 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:15,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-18 09:43:15,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:15,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-02-18 09:43:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:43:15,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:43:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:43:16,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:43:16,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-18 09:43:16,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:43:16,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:43:16,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:43:16,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:43:16,649 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-02-18 09:43:26,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:43:26,951 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-02-18 09:43:26,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:43:26,952 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-18 09:43:26,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:43:26,959 INFO L225 Difference]: With dead ends: 3181 [2019-02-18 09:43:26,959 INFO L226 Difference]: Without dead ends: 3179 [2019-02-18 09:43:26,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-02-18 09:43:26,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-02-18 09:43:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-02-18 09:43:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-02-18 09:43:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-02-18 09:43:34,563 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-02-18 09:43:34,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:43:34,563 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-02-18 09:43:34,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:43:34,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-02-18 09:43:34,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:43:34,566 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:43:34,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:43:34,566 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:43:34,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:43:34,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-02-18 09:43:34,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:43:34,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:34,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:43:34,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:34,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:43:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:43:34,731 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-18 09:43:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:43:34,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:43:34,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-18 09:43:34,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:43:34,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 09:43:34,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 09:43:34,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-18 09:43:34,925 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-02-18 09:43:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:43:41,910 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-02-18 09:43:41,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:43:41,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-18 09:43:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:43:41,917 INFO L225 Difference]: With dead ends: 2346 [2019-02-18 09:43:41,917 INFO L226 Difference]: Without dead ends: 2337 [2019-02-18 09:43:41,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-18 09:43:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-02-18 09:43:49,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-02-18 09:43:49,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-02-18 09:43:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-02-18 09:43:49,476 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-02-18 09:43:49,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:43:49,476 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-02-18 09:43:49,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 09:43:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-02-18 09:43:49,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:43:49,480 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:43:49,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:43:49,480 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:43:49,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:43:49,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-02-18 09:43:49,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:43:49,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:49,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:43:49,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:49,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:43:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:43:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:43:49,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:49,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:43:49,639 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:43:49,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:43:49,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:49,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:43:49,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:43:49,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:43:49,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-18 09:43:49,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:43:49,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:43:49,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:49,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 09:43:49,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:49,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:49,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 09:43:49,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:49,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:49,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:49,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:49,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 09:43:49,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:49,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:49,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:49,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:49,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:49,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:49,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:43:49,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:49,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:49,847 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:49,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:49,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:43:49,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:43:49,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:43:49,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:43:49,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:43:49,897 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:49,920 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:49,933 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:49,944 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:49,953 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:49,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:49,981 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-18 09:43:50,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:43:50,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:50,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:50,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-18 09:43:50,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-18 09:43:50,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:50,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:50,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-18 09:43:50,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,378 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:50,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,403 INFO L303 Elim1Store]: Index analysis took 267 ms [2019-02-18 09:43:50,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-18 09:43:50,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:50,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:50,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2019-02-18 09:43:50,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,697 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:50,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-18 09:43:50,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:50,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:50,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:43:50,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:50,770 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:50,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-18 09:43:50,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:50,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:50,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-02-18 09:43:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:43:50,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:43:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:43:50,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:43:50,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-18 09:43:50,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:43:50,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:43:50,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:43:50,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:43:50,944 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-02-18 09:43:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:43:58,816 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-02-18 09:43:58,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:43:58,816 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-18 09:43:58,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:43:58,822 INFO L225 Difference]: With dead ends: 2345 [2019-02-18 09:43:58,822 INFO L226 Difference]: Without dead ends: 2338 [2019-02-18 09:43:58,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-02-18 09:43:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-02-18 09:44:00,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-02-18 09:44:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-02-18 09:44:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-02-18 09:44:00,900 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-02-18 09:44:00,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:44:00,900 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-02-18 09:44:00,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:44:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-02-18 09:44:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:44:00,901 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:44:00,901 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-18 09:44:00,902 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:44:00,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:44:00,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-02-18 09:44:00,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:44:00,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:00,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:44:00,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:00,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:44:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:44:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:44:01,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:01,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:44:01,098 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:44:01,098 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-02-18 09:44:01,099 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:44:01,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:44:01,101 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:44:01,101 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:44:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:44:01,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:44:01,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:01,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:44:01,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:44:01,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:44:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:44:01,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:44:01,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:44:01,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:44:01,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:44:01,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:44:01,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 09:44:01,152 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:01,169 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:01,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:01,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:01,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:01,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 09:44:01,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 09:44:01,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:44:01,353 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:01,400 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:01,409 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:01,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:01,427 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-18 09:44:01,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:44:01,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:01,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:01,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-02-18 09:44:01,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-18 09:44:01,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:01,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:01,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-02-18 09:44:01,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-02-18 09:44:01,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:01,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:01,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:16 [2019-02-18 09:44:01,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:01,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-02-18 09:44:01,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:01,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:01,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2019-02-18 09:44:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:01,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:44:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:01,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:44:01,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-18 09:44:01,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:44:01,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:44:01,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:44:01,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:44:01,647 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-02-18 09:44:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:44:03,950 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-02-18 09:44:03,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:44:03,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-18 09:44:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:44:03,953 INFO L225 Difference]: With dead ends: 480 [2019-02-18 09:44:03,953 INFO L226 Difference]: Without dead ends: 477 [2019-02-18 09:44:03,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:44:03,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-02-18 09:44:04,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-02-18 09:44:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-02-18 09:44:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-02-18 09:44:04,865 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-02-18 09:44:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:44:04,866 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-02-18 09:44:04,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:44:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-02-18 09:44:04,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:44:04,866 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:44:04,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:44:04,866 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:44:04,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:44:04,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-02-18 09:44:04,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:44:04,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:04,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:44:04,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:04,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:44:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:44:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:44:04,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:04,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:44:04,928 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:44:04,928 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-02-18 09:44:04,929 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:44:04,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:44:04,931 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:44:04,931 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:44:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:44:04,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:44:04,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:04,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:44:04,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:44:04,941 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:44:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:44:04,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:44:04,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:44:04,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:44:04,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:04,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:04,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:44:04,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:04,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:04,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:04,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:44:04,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:04,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:04,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:04,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:04,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:44:04,985 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:05,010 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:05,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:05,034 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:05,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:05,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:44:05,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:44:05,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:44:05,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:44:05,159 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:05,172 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:05,185 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:05,200 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:05,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:05,227 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:44:05,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:44:05,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:05,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:05,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:44:05,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 09:44:05,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:05,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:05,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 09:44:05,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:05,349 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:44:05,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-18 09:44:05,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:05,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:05,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 09:44:05,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:05,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:44:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:05,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:44:05,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 09:44:05,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:44:05,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:44:05,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:44:05,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:44:05,440 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-02-18 09:44:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:44:07,221 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-02-18 09:44:07,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:44:07,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-18 09:44:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:44:07,223 INFO L225 Difference]: With dead ends: 250 [2019-02-18 09:44:07,223 INFO L226 Difference]: Without dead ends: 243 [2019-02-18 09:44:07,223 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-02-18 09:44:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-18 09:44:08,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-02-18 09:44:08,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-18 09:44:08,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-02-18 09:44:08,723 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-02-18 09:44:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:44:08,723 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-02-18 09:44:08,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:44:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-02-18 09:44:08,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:44:08,724 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:44:08,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:44:08,724 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:44:08,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:44:08,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-02-18 09:44:08,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:44:08,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:08,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:44:08,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:08,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:44:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:44:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:44:08,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:08,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:44:08,824 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:44:08,824 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-02-18 09:44:08,824 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:44:08,825 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:44:08,826 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:44:08,826 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:44:08,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:44:08,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:44:08,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:08,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:44:08,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:44:08,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:44:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:44:08,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:44:08,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:44:08,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:44:08,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:08,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:08,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:44:08,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:08,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:08,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:08,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:44:08,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 09:44:08,870 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:08,887 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:08,900 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:08,909 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:08,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:08,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 09:44:08,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:08,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:08,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 09:44:08,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:08,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:08,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:08,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:08,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:44:08,976 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:08,984 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:08,993 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:09,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:09,011 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-18 09:44:09,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:09,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:44:09,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:09,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:09,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-02-18 09:44:09,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:09,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:09,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:09,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:09,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:09,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-18 09:44:09,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:09,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:09,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-18 09:44:09,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:09,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:09,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:09,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:09,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:09,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:09,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:09,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:09,100 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:44:09,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 56 [2019-02-18 09:44:09,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:09,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:09,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-02-18 09:44:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:09,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:44:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:09,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:44:09,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:44:09,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:44:09,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:44:09,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:44:09,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:44:09,179 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-02-18 09:44:12,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:44:12,260 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-02-18 09:44:12,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:44:12,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-18 09:44:12,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:44:12,262 INFO L225 Difference]: With dead ends: 372 [2019-02-18 09:44:12,262 INFO L226 Difference]: Without dead ends: 362 [2019-02-18 09:44:12,263 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-02-18 09:44:12,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-02-18 09:44:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-02-18 09:44:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-02-18 09:44:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-02-18 09:44:14,577 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-02-18 09:44:14,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:44:14,577 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-02-18 09:44:14,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:44:14,577 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-02-18 09:44:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:44:14,578 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:44:14,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:44:14,578 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:44:14,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:44:14,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-02-18 09:44:14,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:44:14,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:14,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:44:14,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:14,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:44:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:44:14,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:14,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:14,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:44:14,656 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:44:14,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:44:14,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:14,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:44:14,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:44:14,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:44:14,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:44:14,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:44:14,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:44:14,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:44:14,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:44:14,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:44:14,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:44:14,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:44:14,711 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:14,736 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:14,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:14,759 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:14,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:14,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:44:14,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:44:14,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:44:14,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:44:14,881 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:14,895 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:14,908 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:14,923 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:14,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:14,950 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:44:14,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:14,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 09:44:14,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:14,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:14,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 09:44:15,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:15,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:15,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:15,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:15,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:15,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:15,027 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:44:15,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 09:44:15,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:44:15,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 09:44:15,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-18 09:44:15,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:15,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:15,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:15,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:15,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:15,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:15,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:15,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:44:15,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:15,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:15,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-02-18 09:44:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:15,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:44:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:15,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:44:15,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:44:15,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:44:15,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:44:15,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:44:15,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:44:15,283 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-02-18 09:44:18,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:44:18,098 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-02-18 09:44:18,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:44:18,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-18 09:44:18,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:44:18,100 INFO L225 Difference]: With dead ends: 332 [2019-02-18 09:44:18,100 INFO L226 Difference]: Without dead ends: 325 [2019-02-18 09:44:18,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:44:18,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-02-18 09:44:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-02-18 09:44:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-02-18 09:44:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-02-18 09:44:20,485 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-02-18 09:44:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:44:20,486 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-02-18 09:44:20,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:44:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-02-18 09:44:20,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:44:20,486 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:44:20,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:44:20,487 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:44:20,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:44:20,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-02-18 09:44:20,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:44:20,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:20,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:44:20,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:20,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:44:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:44:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:44:20,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:20,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:44:20,569 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:44:20,570 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-02-18 09:44:20,570 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:44:20,570 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:44:20,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:44:20,573 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:44:20,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:44:20,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:44:20,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:20,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:44:20,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:44:20,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:44:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:44:20,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:44:20,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:44:20,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:44:20,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:44:20,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:44:20,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:20,706 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:20,720 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:20,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:20,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:44:20,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:44:20,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:44:20,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:44:20,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:44:20,768 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:20,789 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:20,800 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:20,810 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:20,819 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:20,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:20,845 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 09:44:20,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:44:20,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:20,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:20,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:44:20,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,934 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:44:20,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-18 09:44:20,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:20,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:20,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-18 09:44:20,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:20,977 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:44:20,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-18 09:44:20,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:20,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:20,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-18 09:44:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:21,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:44:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:21,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:44:21,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:44:21,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:44:21,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:44:21,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:44:21,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:44:21,078 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-02-18 09:44:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:44:23,612 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-02-18 09:44:23,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:44:23,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-18 09:44:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:44:23,614 INFO L225 Difference]: With dead ends: 294 [2019-02-18 09:44:23,614 INFO L226 Difference]: Without dead ends: 287 [2019-02-18 09:44:23,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:44:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-02-18 09:44:25,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-02-18 09:44:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-02-18 09:44:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-02-18 09:44:26,000 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-02-18 09:44:26,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:44:26,000 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-02-18 09:44:26,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:44:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-02-18 09:44:26,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:44:26,000 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:44:26,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:44:26,001 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:44:26,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:44:26,001 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-02-18 09:44:26,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:44:26,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:26,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:44:26,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:26,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:44:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:44:26,214 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-02-18 09:44:26,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-02-18 09:44:26,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:26,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:44:26,276 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:44:26,277 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-02-18 09:44:26,277 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:44:26,278 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:44:26,279 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:44:26,279 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:44:26,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:44:26,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:44:26,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:26,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 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-02-18 09:44:26,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:44:26,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:44:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:44:26,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:44:26,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:44:26,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:44:26,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:44:26,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:44:26,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:44:26,322 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:26,347 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:26,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:26,371 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:26,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:26,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:44:26,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:44:26,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:44:26,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:44:26,494 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:26,508 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:26,521 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:26,536 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:26,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:26,563 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 09:44:26,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 09:44:26,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:26,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:26,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-18 09:44:26,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 09:44:26,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:44:26,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:44:26,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:74 [2019-02-18 09:44:26,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,838 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:44:26,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 69 [2019-02-18 09:44:26,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:26,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:26,899 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:44:26,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-02-18 09:44:26,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:26,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 09:44:26,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:70 [2019-02-18 09:44:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:27,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:44:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:27,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:44:27,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-18 09:44:27,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:44:27,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:44:27,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:44:27,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:44:27,095 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-02-18 09:44:27,581 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-02-18 09:44:30,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:44:30,595 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-02-18 09:44:30,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:44:30,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-18 09:44:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:44:30,597 INFO L225 Difference]: With dead ends: 364 [2019-02-18 09:44:30,598 INFO L226 Difference]: Without dead ends: 357 [2019-02-18 09:44:30,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:44:30,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-02-18 09:44:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-02-18 09:44:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-02-18 09:44:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-02-18 09:44:33,171 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-02-18 09:44:33,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:44:33,171 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-02-18 09:44:33,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:44:33,171 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-02-18 09:44:33,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:44:33,172 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:44:33,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:44:33,172 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:44:33,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:44:33,173 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-02-18 09:44:33,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:44:33,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:33,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:44:33,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:33,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:44:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:44:33,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:44:33,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:33,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:44:33,249 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:44:33,249 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-02-18 09:44:33,250 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:44:33,250 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:44:33,251 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:44:33,251 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:44:33,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:44:33,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:44:33,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:33,252 INFO 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-02-18 09:44:33,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:44:33,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:44:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:44:33,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:44:33,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:44:33,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:44:33,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:44:33,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:44:33,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:44:33,305 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:33,330 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:33,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:33,353 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:33,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:33,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:44:33,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:44:33,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:44:33,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:44:33,474 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:33,488 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:33,501 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:33,516 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:33,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:33,542 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 09:44:33,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:44:33,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:33,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:33,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:44:33,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-18 09:44:33,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:33,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:33,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-18 09:44:33,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:33,679 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:44:33,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 09:44:33,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:33,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:33,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 09:44:33,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:33,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:44:33,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:33,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:44:33,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 09:44:33,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:44:33,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:44:33,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:44:33,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:44:33,818 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-02-18 09:44:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:44:36,854 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-02-18 09:44:36,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:44:36,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-18 09:44:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:44:36,856 INFO L225 Difference]: With dead ends: 319 [2019-02-18 09:44:36,856 INFO L226 Difference]: Without dead ends: 312 [2019-02-18 09:44:36,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:44:36,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-02-18 09:44:39,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-02-18 09:44:39,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-02-18 09:44:39,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-02-18 09:44:39,710 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-02-18 09:44:39,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:44:39,710 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-02-18 09:44:39,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:44:39,710 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-02-18 09:44:39,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:44:39,711 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:44:39,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:44:39,711 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:44:39,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:44:39,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-02-18 09:44:39,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:44:39,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:39,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:44:39,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:39,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:44:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:44:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:44:39,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:39,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:44:39,863 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:44:39,863 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-02-18 09:44:39,864 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:44:39,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:44:39,866 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:44:39,866 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:44:39,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:44:39,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:44:39,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:39,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:44:39,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:44:39,875 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:44:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:44:39,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:44:39,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:44:39,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:39,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:39,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:44:39,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:39,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:39,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:39,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:39,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:44:39,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:39,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:39,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:39,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:39,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:39,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:39,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:44:39,988 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:40,002 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:40,018 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:40,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:40,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:44:40,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:44:40,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:44:40,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:44:40,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:44:40,072 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:40,093 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:40,107 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:40,116 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:40,126 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:40,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:40,152 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 09:44:40,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:44:40,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:44:40,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 09:44:40,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-18 09:44:40,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 67 [2019-02-18 09:44:40,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:40,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-02-18 09:44:40,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:40,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:44:40,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-02-18 09:44:40,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,536 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:44:40,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-02-18 09:44:40,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:40,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,596 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:44:40,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:40,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-02-18 09:44:40,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:40,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 09:44:40,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-02-18 09:44:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:40,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:44:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:40,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:44:40,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-18 09:44:40,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:44:40,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:44:40,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:44:40,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:44:40,757 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-02-18 09:44:42,102 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-02-18 09:44:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:44:45,021 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-02-18 09:44:45,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:44:45,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-18 09:44:45,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:44:45,023 INFO L225 Difference]: With dead ends: 392 [2019-02-18 09:44:45,024 INFO L226 Difference]: Without dead ends: 386 [2019-02-18 09:44:45,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:44:45,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-02-18 09:44:48,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-02-18 09:44:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-02-18 09:44:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-02-18 09:44:48,142 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-02-18 09:44:48,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:44:48,142 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-02-18 09:44:48,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:44:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-02-18 09:44:48,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:44:48,143 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:44:48,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:44:48,143 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:44:48,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:44:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-02-18 09:44:48,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:44:48,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:48,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:44:48,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:48,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:44:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:44:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:44:48,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:44:48,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-18 09:44:48,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:44:48,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 09:44:48,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 09:44:48,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-18 09:44:48,222 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-02-18 09:44:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:44:51,102 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-02-18 09:44:51,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:44:51,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-18 09:44:51,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:44:51,104 INFO L225 Difference]: With dead ends: 320 [2019-02-18 09:44:51,104 INFO L226 Difference]: Without dead ends: 315 [2019-02-18 09:44:51,104 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-02-18 09:44:51,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-02-18 09:44:54,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-02-18 09:44:54,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-02-18 09:44:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-02-18 09:44:54,174 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-02-18 09:44:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:44:54,175 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-02-18 09:44:54,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 09:44:54,175 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-02-18 09:44:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:44:54,175 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:44:54,176 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:44:54,176 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:44:54,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:44:54,176 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-02-18 09:44:54,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:44:54,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:54,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:44:54,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:44:54,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:44:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:44:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:44:54,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:54,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:44:54,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:44:54,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:44:54,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:44:54,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:44:54,258 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:44:54,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:44:54,263 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:44:54,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:44:54,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:44:54,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:44:54,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:44:54,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:44:54,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:44:54,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:54,375 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:54,389 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:54,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:54,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:44:54,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:44:54,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:44:54,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:44:54,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:44:54,437 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:54,458 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:54,469 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:54,479 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:54,488 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:44:54,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:54,513 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:44:54,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-18 09:44:54,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:54,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:54,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-18 09:44:54,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2019-02-18 09:44:54,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:54,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:54,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:46 [2019-02-18 09:44:54,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-02-18 09:44:54,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:44:54,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:44:54,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-02-18 09:44:54,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:44:54,824 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:44:54,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-18 09:44:54,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:44:54,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:44:54,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 09:44:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:54,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:44:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:44:54,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:44:54,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:44:54,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:44:54,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:44:54,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:44:54,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:44:54,952 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-02-18 09:45:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:45:01,114 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-02-18 09:45:01,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:45:01,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-18 09:45:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:45:01,116 INFO L225 Difference]: With dead ends: 601 [2019-02-18 09:45:01,116 INFO L226 Difference]: Without dead ends: 591 [2019-02-18 09:45:01,116 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-02-18 09:45:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-02-18 09:45:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-02-18 09:45:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-02-18 09:45:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-02-18 09:45:06,190 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-02-18 09:45:06,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:45:06,191 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-02-18 09:45:06,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:45:06,191 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-02-18 09:45:06,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:45:06,192 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:45:06,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:45:06,192 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:45:06,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:45:06,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-02-18 09:45:06,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:45:06,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:45:06,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:45:06,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:45:06,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:45:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:45:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:45:06,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:45:06,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:45:06,343 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:45:06,343 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-02-18 09:45:06,344 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:45:06,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:45:06,346 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:45:06,346 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:45:06,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:45:06,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:45:06,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:45:06,346 INFO 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-02-18 09:45:06,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:45:06,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:45:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:45:06,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:45:06,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:45:06,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:45:06,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:45:06,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:45:06,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:06,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:06,498 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:06,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:06,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:45:06,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:45:06,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:45:06,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:45:06,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:45:06,554 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:06,574 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:06,586 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:06,595 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:06,605 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:06,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:45:06,631 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:45:06,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-18 09:45:06,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:06,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:45:06,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 09:45:06,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-02-18 09:45:06,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:06,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:45:06,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-02-18 09:45:06,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,775 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:45:06,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:06,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 93 [2019-02-18 09:45:06,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:45:06,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 09:45:06,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-02-18 09:45:06,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-02-18 09:45:06,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:45:07,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:45:07,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:45:07,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:45:07,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:45:07,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:45:07,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:45:07,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:45:07,025 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-02-18 09:45:16,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:45:16,458 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-02-18 09:45:16,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:45:16,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-18 09:45:16,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:45:16,460 INFO L225 Difference]: With dead ends: 731 [2019-02-18 09:45:16,460 INFO L226 Difference]: Without dead ends: 718 [2019-02-18 09:45:16,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:45:16,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-02-18 09:45:24,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-02-18 09:45:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-02-18 09:45:24,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-02-18 09:45:24,813 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-02-18 09:45:24,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:45:24,813 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-02-18 09:45:24,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:45:24,813 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-02-18 09:45:24,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:45:24,814 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:45:24,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:45:24,814 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:45:24,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:45:24,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-02-18 09:45:24,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:45:24,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:45:24,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:45:24,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:45:24,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:45:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:45:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:45:24,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:45:24,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:45:24,910 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:45:24,910 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-02-18 09:45:24,910 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:45:24,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:45:24,912 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:45:24,913 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:45:24,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:45:24,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:45:24,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:45:24,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 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-02-18 09:45:24,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:45:24,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:45:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:45:24,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:45:24,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:45:24,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:24,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:24,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:45:24,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:24,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:24,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:24,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:24,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:45:25,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:45:25,030 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:25,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:25,061 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:25,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:25,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:45:25,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:45:25,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:45:25,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:45:25,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:45:25,118 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:25,154 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:25,166 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:25,175 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:25,185 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:25,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:45:25,211 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 09:45:25,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:45:25,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:25,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:25,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:33 [2019-02-18 09:45:25,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:45:25,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:25,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:45:25,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-02-18 09:45:25,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,354 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:45:25,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 09:45:25,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:25,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:45:25,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-18 09:45:25,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:25,405 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:45:25,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-18 09:45:25,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:25,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:45:25,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-02-18 09:45:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:45:25,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:45:25,518 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:45:25,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:45:25,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:45:25,537 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:45:25,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:45:25,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:45:25,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:45:25,537 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-02-18 09:45:35,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:45:35,298 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-02-18 09:45:35,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:45:35,299 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-18 09:45:35,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:45:35,300 INFO L225 Difference]: With dead ends: 480 [2019-02-18 09:45:35,300 INFO L226 Difference]: Without dead ends: 473 [2019-02-18 09:45:35,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:45:35,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-02-18 09:45:38,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-02-18 09:45:38,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-18 09:45:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-02-18 09:45:38,564 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-02-18 09:45:38,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:45:38,564 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-02-18 09:45:38,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:45:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-02-18 09:45:38,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:45:38,565 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:45:38,565 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:45:38,565 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:45:38,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:45:38,566 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-02-18 09:45:38,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:45:38,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:45:38,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:45:38,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:45:38,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:45:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:45:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:45:38,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:45:38,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:45:38,664 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:45:38,664 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-02-18 09:45:38,665 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:45:38,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:45:38,667 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:45:38,667 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:45:38,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:45:38,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:45:38,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:45:38,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:45:38,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:45:38,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:45:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:45:38,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:45:38,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:45:38,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:45:38,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:45:38,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:45:38,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:45:38,714 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:38,739 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:38,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:38,761 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:38,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:38,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:45:38,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:45:38,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:45:38,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:38,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:45:38,883 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:38,897 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:38,911 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:38,926 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:38,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:45:38,952 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 09:45:39,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:39,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:45:39,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:39,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:45:39,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:45:39,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:39,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:39,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:39,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:39,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:39,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:39,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 09:45:39,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:39,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:45:39,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 09:45:39,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:39,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:39,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:39,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:39,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:39,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:39,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:39,093 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:45:39,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:39,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-02-18 09:45:39,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:39,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:45:39,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 09:45:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:45:39,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:45:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:45:39,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:45:39,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:45:39,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:45:39,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:45:39,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:45:39,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:45:39,188 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-02-18 09:45:44,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:45:44,318 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-02-18 09:45:44,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:45:44,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-18 09:45:44,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:45:44,320 INFO L225 Difference]: With dead ends: 258 [2019-02-18 09:45:44,320 INFO L226 Difference]: Without dead ends: 243 [2019-02-18 09:45:44,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:45:44,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-18 09:45:48,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-02-18 09:45:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-02-18 09:45:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-02-18 09:45:48,708 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-02-18 09:45:48,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:45:48,708 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-02-18 09:45:48,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:45:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-02-18 09:45:48,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:45:48,709 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:45:48,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:45:48,709 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:45:48,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:45:48,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-02-18 09:45:48,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:45:48,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:45:48,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:45:48,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:45:48,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:45:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:45:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:45:48,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:45:48,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:45:48,872 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:45:48,872 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-02-18 09:45:48,873 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:45:48,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:45:48,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:45:48,874 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:45:48,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:45:48,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:45:48,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:45:48,874 INFO 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-02-18 09:45:48,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:45:48,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:45:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:45:48,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:45:48,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:45:48,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:45:48,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:48,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:48,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:45:48,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:48,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:48,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:48,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:45:48,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:48,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:48,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:48,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:48,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:45:48,916 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:48,958 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:48,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:48,980 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:48,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:49,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:45:49,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:45:49,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:45:49,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:45:49,114 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:49,129 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:49,142 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:49,157 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:49,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:45:49,183 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-02-18 09:45:49,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 09:45:49,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:49,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:45:49,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-02-18 09:45:49,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,281 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:45:49,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 09:45:49,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:45:49,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 09:45:49,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-02-18 09:45:49,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,425 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:45:49,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-02-18 09:45:49,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:49,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 90 [2019-02-18 09:45:49,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:49,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:45:49,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:68 [2019-02-18 09:45:49,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,600 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:45:49,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 102 [2019-02-18 09:45:49,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:49,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:45:49,682 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:45:49,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-02-18 09:45:49,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:45:49,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 09:45:49,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-02-18 09:45:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:45:49,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:45:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:45:49,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:45:49,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:45:49,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:45:49,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:45:49,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:45:49,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:45:49,834 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-02-18 09:45:55,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:45:55,889 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-02-18 09:45:55,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:45:55,890 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-18 09:45:55,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:45:55,891 INFO L225 Difference]: With dead ends: 295 [2019-02-18 09:45:55,891 INFO L226 Difference]: Without dead ends: 284 [2019-02-18 09:45:55,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-02-18 09:45:55,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-02-18 09:46:00,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-02-18 09:46:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-18 09:46:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-02-18 09:46:00,610 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-02-18 09:46:00,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:46:00,610 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-02-18 09:46:00,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:46:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-02-18 09:46:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:46:00,611 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:46:00,611 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:46:00,611 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:46:00,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:46:00,611 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-02-18 09:46:00,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:46:00,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:46:00,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:46:00,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:46:00,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:46:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:46:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:46:00,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:46:00,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:46:00,716 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:46:00,717 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-02-18 09:46:00,717 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:46:00,718 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:46:00,719 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:46:00,719 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:46:00,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:46:00,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:46:00,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:46:00,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:46:00,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:46:00,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:46:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:46:00,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:46:00,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:46:00,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:46:00,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:46:00,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:46:00,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:46:00,763 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:00,788 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:00,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:00,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:00,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:00,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:46:00,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:46:00,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:46:00,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:00,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:46:00,940 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:00,955 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:00,968 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:00,983 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:01,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:46:01,010 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-18 09:46:01,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:01,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 09:46:01,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:01,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:46:01,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 09:46:01,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:01,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:01,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:01,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:01,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:01,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:01,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:01,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 09:46:01,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:46:01,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:46:01,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-02-18 09:46:01,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:01,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:01,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:01,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:01,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:01,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:01,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:01,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:01,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:01,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 09:46:01,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:01,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:46:01,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:25 [2019-02-18 09:46:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:46:01,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:46:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:46:01,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:46:01,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:46:01,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:46:01,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:46:01,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:46:01,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:46:01,384 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-02-18 09:46:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:46:08,190 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-02-18 09:46:08,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:46:08,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-18 09:46:08,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:46:08,192 INFO L225 Difference]: With dead ends: 328 [2019-02-18 09:46:08,192 INFO L226 Difference]: Without dead ends: 315 [2019-02-18 09:46:08,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:46:08,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-02-18 09:46:14,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-02-18 09:46:14,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-02-18 09:46:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-02-18 09:46:14,842 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-02-18 09:46:14,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:46:14,842 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-02-18 09:46:14,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:46:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-02-18 09:46:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:46:14,843 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:46:14,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:46:14,843 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:46:14,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:46:14,843 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-02-18 09:46:14,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:46:14,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:46:14,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:46:14,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:46:14,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:46:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:46:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:46:14,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:46:14,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:46:14,948 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:46:14,948 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-02-18 09:46:14,948 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:46:14,949 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:46:14,950 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:46:14,950 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:46:14,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:46:14,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:46:14,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:46:14,951 INFO 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-02-18 09:46:14,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:46:14,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:46:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:46:14,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:46:15,165 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-02-18 09:46:15,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 09:46:15,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 09:46:15,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 09:46:15,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:46:15,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:15,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:15,322 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:15,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:15,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:46:15,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:46:15,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:46:15,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:46:15,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:46:15,381 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:15,404 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:15,417 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:15,427 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:15,436 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:15,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:46:15,463 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-18 09:46:15,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:46:15,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:15,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:46:15,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-18 09:46:15,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-18 09:46:15,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:15,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:46:15,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-18 09:46:15,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,623 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:46:15,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:15,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-18 09:46:15,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:15,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:46:15,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-02-18 09:46:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:46:15,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:46:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:46:15,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:46:15,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:46:15,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:46:15,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:46:15,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:46:15,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:46:15,746 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-02-18 09:46:24,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:46:24,909 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-02-18 09:46:24,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:46:24,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-18 09:46:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:46:24,910 INFO L225 Difference]: With dead ends: 326 [2019-02-18 09:46:24,911 INFO L226 Difference]: Without dead ends: 313 [2019-02-18 09:46:24,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:46:24,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-02-18 09:46:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-02-18 09:46:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-02-18 09:46:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-02-18 09:46:33,121 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-02-18 09:46:33,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:46:33,121 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-02-18 09:46:33,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:46:33,121 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-02-18 09:46:33,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:46:33,122 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:46:33,122 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:46:33,122 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:46:33,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:46:33,123 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-02-18 09:46:33,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:46:33,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:46:33,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:46:33,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:46:33,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:46:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:46:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-18 09:46:33,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:46:33,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:46:33,221 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:46:33,221 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-02-18 09:46:33,222 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:46:33,222 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:46:33,223 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:46:33,224 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:46:33,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:46:33,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:46:33,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:46:33,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:46:33,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:46:33,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:46:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:46:33,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:46:33,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:46:33,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:46:33,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:46:33,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,519 INFO L303 Elim1Store]: Index analysis took 113 ms [2019-02-18 09:46:33,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:46:33,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,631 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-02-18 09:46:33,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:46:33,631 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:33,655 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:33,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:33,678 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:33,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:33,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:46:33,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:46:33,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:46:33,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:46:33,802 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:33,816 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:33,829 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:33,844 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:33,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:46:33,871 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:46:33,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:33,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:46:33,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:46:33,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:46:33,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-02-18 09:46:34,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,042 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:46:34,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-02-18 09:46:34,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:34,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:46:34,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2019-02-18 09:46:34,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-18 09:46:34,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:34,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:46:34,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-18 09:46:34,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:34,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-02-18 09:46:34,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:34,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:46:34,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-02-18 09:46:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:46:34,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:46:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:46:34,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:46:34,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-18 09:46:34,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:46:34,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:46:34,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:46:34,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:46:34,244 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-02-18 09:46:45,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:46:45,363 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-02-18 09:46:45,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:46:45,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-18 09:46:45,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:46:45,365 INFO L225 Difference]: With dead ends: 400 [2019-02-18 09:46:45,365 INFO L226 Difference]: Without dead ends: 393 [2019-02-18 09:46:45,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:46:45,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-02-18 09:46:55,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-02-18 09:46:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-02-18 09:46:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-02-18 09:46:55,676 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-02-18 09:46:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:46:55,676 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-02-18 09:46:55,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:46:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-02-18 09:46:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:46:55,677 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:46:55,677 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:46:55,677 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:46:55,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:46:55,677 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-02-18 09:46:55,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:46:55,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:46:55,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:46:55,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:46:55,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:46:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:46:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-18 09:46:55,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:46:55,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:46:55,780 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:46:55,780 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-02-18 09:46:55,781 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:46:55,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:46:55,783 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:46:55,783 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:46:55,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:46:55,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:46:55,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:46:55,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:46:55,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:46:55,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:46:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:46:55,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:46:55,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:46:55,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:46:55,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:55,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:55,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:46:55,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:55,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:55,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:55,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:46:55,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:55,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:55,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:55,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:55,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:46:55,844 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:55,870 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:55,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:55,894 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:55,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:55,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:46:55,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:55,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:55,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:46:55,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:55,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:55,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:55,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:55,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:46:56,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:46:56,016 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:56,030 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:56,042 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:56,064 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:46:56,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:46:56,091 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 09:46:56,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:46:56,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:46:56,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:46:56,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-02-18 09:46:56,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,285 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:46:56,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 62 [2019-02-18 09:46:56,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:56,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,348 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:46:56,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 79 [2019-02-18 09:46:56,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:56,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:46:56,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:74 [2019-02-18 09:46:56,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 82 [2019-02-18 09:46:56,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:56,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,498 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:46:56,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-18 09:46:56,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:56,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:46:56,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-02-18 09:46:56,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 102 [2019-02-18 09:46:56,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:56,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:46:56,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2019-02-18 09:46:56,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:46:56,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 09:46:56,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-02-18 09:46:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:46:56,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:46:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:46:56,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:46:56,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-18 09:46:56,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:46:56,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:46:56,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:46:56,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:46:56,808 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-02-18 09:47:08,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:47:08,972 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-02-18 09:47:08,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:47:08,972 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-18 09:47:08,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:47:08,974 INFO L225 Difference]: With dead ends: 441 [2019-02-18 09:47:08,974 INFO L226 Difference]: Without dead ends: 428 [2019-02-18 09:47:08,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:47:08,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-02-18 09:47:19,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-02-18 09:47:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-02-18 09:47:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-02-18 09:47:19,320 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-02-18 09:47:19,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:47:19,320 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-02-18 09:47:19,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:47:19,320 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-02-18 09:47:19,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:47:19,321 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:47:19,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:47:19,321 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:47:19,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:47:19,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-02-18 09:47:19,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:47:19,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:47:19,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:47:19,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:47:19,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:47:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:47:19,577 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-02-18 09:47:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-18 09:47:19,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:47:19,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:47:19,659 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:47:19,659 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-02-18 09:47:19,660 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:47:19,660 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:47:19,662 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:47:19,662 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:47:19,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:47:19,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:47:19,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:47:19,663 INFO 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-02-18 09:47:19,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:47:19,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:47:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:47:19,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:47:19,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:47:19,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:47:19,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:47:19,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:47:19,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:47:19,705 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:47:19,729 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:47:19,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:47:19,753 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:47:19,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:47:19,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:47:19,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:47:19,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:47:19,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:47:19,877 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:47:19,891 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:47:19,904 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:47:19,919 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:47:19,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:47:19,946 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 09:47:19,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:19,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:47:19,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:47:20,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 09:47:20,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-18 09:47:20,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 67 [2019-02-18 09:47:20,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:47:20,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 96 [2019-02-18 09:47:20,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:47:20,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:47:20,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-02-18 09:47:20,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,325 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:47:20,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-02-18 09:47:20,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:47:20,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,388 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:47:20,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-02-18 09:47:20,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:47:20,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:47:20,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-02-18 09:47:20,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,481 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:47:20,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 83 [2019-02-18 09:47:20,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:47:20,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:20,543 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:47:20,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 106 [2019-02-18 09:47:20,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:47:20,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 09:47:20,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-02-18 09:47:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:47:20,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:47:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:47:20,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:47:20,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:47:20,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:47:20,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:47:20,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:47:20,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:47:20,722 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-02-18 09:47:40,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:47:40,575 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-02-18 09:47:40,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:47:40,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-18 09:47:40,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:47:40,577 INFO L225 Difference]: With dead ends: 685 [2019-02-18 09:47:40,578 INFO L226 Difference]: Without dead ends: 677 [2019-02-18 09:47:40,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:47:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-02-18 09:47:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-02-18 09:47:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-02-18 09:47:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-02-18 09:47:55,954 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-02-18 09:47:55,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:47:55,954 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-02-18 09:47:55,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:47:55,954 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-02-18 09:47:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:47:55,955 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:47:55,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:47:55,956 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:47:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:47:55,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-02-18 09:47:55,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:47:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:47:55,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:47:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:47:55,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:47:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:47:56,211 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-02-18 09:47:56,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:47:56,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:47:56,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:47:56,298 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:47:56,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:47:56,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:47:56,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:47:56,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:47:56,309 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:47:56,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:47:56,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:47:56,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:47:56,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:47:56,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:47:56,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:47:56,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:47:56,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:47:56,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:47:56,475 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:47:56,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:47:56,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:47:56,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:47:56,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:47:56,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:47:56,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:47:56,523 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:47:56,544 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:47:56,556 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:47:56,565 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:47:56,574 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:47:56,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:47:56,601 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 09:47:56,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:47:56,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:47:56,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 09:47:56,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-18 09:47:56,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-02-18 09:47:56,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:47:56,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,892 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:47:56,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-02-18 09:47:56,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:47:56,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:47:56,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-02-18 09:47:56,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:56,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,010 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:47:57,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-02-18 09:47:57,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:47:57,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2019-02-18 09:47:57,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:47:57,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:47:57,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:70 [2019-02-18 09:47:57,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2019-02-18 09:47:57,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:47:57,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:47:57,222 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:47:57,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 110 [2019-02-18 09:47:57,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:47:57,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 09:47:57,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-02-18 09:47:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:47:57,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:47:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:47:57,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:47:57,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-18 09:47:57,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:47:57,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:47:57,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:47:57,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:47:57,388 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-02-18 09:47:58,210 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-02-18 09:47:59,044 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-02-18 09:48:12,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:48:12,374 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-02-18 09:48:12,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:48:12,375 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-18 09:48:12,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:48:12,376 INFO L225 Difference]: With dead ends: 550 [2019-02-18 09:48:12,376 INFO L226 Difference]: Without dead ends: 543 [2019-02-18 09:48:12,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-02-18 09:48:12,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-02-18 09:48:15,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-02-18 09:48:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 09:48:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-02-18 09:48:15,439 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-02-18 09:48:15,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:48:15,440 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-02-18 09:48:15,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:48:15,440 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-02-18 09:48:15,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 09:48:15,440 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:48:15,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:48:15,440 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:48:15,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:48:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-02-18 09:48:15,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:48:15,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:48:15,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:48:15,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:48:15,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:48:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:48:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:48:15,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:48:15,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:48:15,511 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-18 09:48:15,511 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-02-18 09:48:15,512 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:48:15,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:48:15,514 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:48:15,514 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:48:15,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:48:15,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:48:15,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:48:15,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:48:15,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:48:15,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:48:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:48:15,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:48:15,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:15,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 09:48:15,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:15,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:15,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 09:48:15,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:15,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:15,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:15,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:15,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 09:48:15,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:15,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:15,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:15,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:15,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:15,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:15,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:48:15,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:15,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:15,700 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:15,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:15,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:48:15,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:48:15,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:48:15,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:48:15,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:48:15,777 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:16,153 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:16,358 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:16,520 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:16,662 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:16,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:48:16,934 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-18 09:48:16,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:16,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:48:16,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:16,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:48:16,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-18 09:48:17,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-18 09:48:17,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:17,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:48:17,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-18 09:48:17,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,097 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:48:17,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-18 09:48:17,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:17,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:48:17,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-02-18 09:48:17,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:17,344 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:48:17,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-18 09:48:17,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:17,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:48:17,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:48:17,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:48:17,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:48:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:48:17,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:48:17,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-18 09:48:17,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:48:17,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:48:17,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:48:17,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:48:17,762 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-02-18 09:48:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:48:23,561 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-02-18 09:48:23,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:48:23,562 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-18 09:48:23,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:48:23,562 INFO L225 Difference]: With dead ends: 67 [2019-02-18 09:48:23,562 INFO L226 Difference]: Without dead ends: 58 [2019-02-18 09:48:23,563 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-02-18 09:48:23,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-18 09:48:26,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-02-18 09:48:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-18 09:48:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-02-18 09:48:26,799 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-02-18 09:48:26,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:48:26,800 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-02-18 09:48:26,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:48:26,800 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-02-18 09:48:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 09:48:26,800 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:48:26,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:48:26,800 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:48:26,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:48:26,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-02-18 09:48:26,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:48:26,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:48:26,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:48:26,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:48:26,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:48:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:48:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-18 09:48:26,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:48:26,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:48:26,937 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-18 09:48:26,937 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-02-18 09:48:26,938 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:48:26,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:48:26,939 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:48:26,939 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:48:26,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:48:26,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:48:26,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:48:26,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 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-02-18 09:48:26,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:48:26,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:48:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:48:26,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:48:26,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:48:26,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:26,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:26,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:48:27,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:48:27,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:48:27,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:27,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:27,083 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:27,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:27,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-18 09:48:27,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:48:27,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:48:27,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:48:27,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:48:27,132 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:27,153 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:27,165 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:27,174 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:27,183 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:27,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:27,209 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-02-18 09:48:27,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-18 09:48:27,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:27,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:48:27,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-02-18 09:48:27,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-02-18 09:48:27,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:48:27,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 09:48:27,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:68 [2019-02-18 09:48:27,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,466 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:48:27,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-18 09:48:27,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:27,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,527 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:48:27,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 104 [2019-02-18 09:48:27,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:27,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:48:27,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-02-18 09:48:27,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,642 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:48:27,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 109 [2019-02-18 09:48:27,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:27,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:27,710 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:48:27,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-02-18 09:48:27,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:27,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 09:48:27,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:64 [2019-02-18 09:48:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:48:27,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:48:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:48:27,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:48:27,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:48:27,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:48:27,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:48:27,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:48:27,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:48:27,877 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-02-18 09:48:34,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:48:34,053 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-02-18 09:48:34,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:48:34,053 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-02-18 09:48:34,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:48:34,054 INFO L225 Difference]: With dead ends: 74 [2019-02-18 09:48:34,054 INFO L226 Difference]: Without dead ends: 59 [2019-02-18 09:48:34,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:48:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-18 09:48:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-02-18 09:48:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 09:48:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-02-18 09:48:37,646 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-02-18 09:48:37,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:48:37,647 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-02-18 09:48:37,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:48:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-02-18 09:48:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 09:48:37,647 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:48:37,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:48:37,647 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:48:37,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:48:37,647 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-02-18 09:48:37,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:48:37,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:48:37,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:48:37,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:48:37,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:48:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:48:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:48:37,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:48:37,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:48:37,782 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-18 09:48:37,782 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-02-18 09:48:37,782 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:48:37,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:48:37,784 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:48:37,784 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:48:37,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:48:37,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:48:37,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:48:37,785 INFO 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-02-18 09:48:37,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:48:37,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:48:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:48:37,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:48:37,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 09:48:37,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:37,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:37,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:48:37,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:37,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:37,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:37,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:37,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 09:48:37,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:37,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:37,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:37,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:37,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:37,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:37,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 09:48:37,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:37,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:37,928 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:37,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:37,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:48:37,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:48:37,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 09:48:37,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 09:48:37,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 09:48:37,976 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:37,997 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:38,009 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:38,018 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:38,027 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:38,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:48:38,054 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 09:48:38,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:48:38,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:38,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:48:38,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:48:38,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:48:38,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:38,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:48:38,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-18 09:48:38,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,272 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:48:38,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-02-18 09:48:38,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:38,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:48:38,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 09:48:38,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:38,326 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:48:38,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-18 09:48:38,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:38,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:48:38,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-18 09:48:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:48:38,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:48:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:48:38,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:48:38,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-18 09:48:38,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:48:38,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:48:38,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:48:38,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:48:38,426 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-02-18 09:48:45,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:48:45,566 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-02-18 09:48:45,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:48:45,567 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-18 09:48:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:48:45,567 INFO L225 Difference]: With dead ends: 80 [2019-02-18 09:48:45,567 INFO L226 Difference]: Without dead ends: 71 [2019-02-18 09:48:45,568 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-02-18 09:48:45,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-18 09:48:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-02-18 09:48:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-18 09:48:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-02-18 09:48:52,118 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-02-18 09:48:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:48:52,118 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-02-18 09:48:52,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:48:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-02-18 09:48:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-18 09:48:52,119 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:48:52,119 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:48:52,119 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:48:52,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:48:52,119 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-02-18 09:48:52,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:48:52,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:48:52,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:48:52,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:48:52,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:48:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:48:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-02-18 09:48:52,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:48:52,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:48:52,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:48:52,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:48:52,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:48:52,214 INFO 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-02-18 09:48:52,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:48:52,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:48:52,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-18 09:48:52,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:48:52,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:48:52,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:48:52,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:48:52,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-18 09:48:52,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-18 09:48:52,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:48:52,269 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:52,284 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:52,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:52,304 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:52,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:52,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-02-18 09:48:52,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-18 09:48:52,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-02-18 09:48:52,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-02-18 09:48:52,357 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:52,364 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:52,371 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:52,377 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:48:52,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:48:52,394 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-02-18 09:48:52,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:48:52,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:48:52,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-18 09:48:52,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-02-18 09:48:52,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-02-18 09:48:52,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:52,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-02-18 09:48:52,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:52,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-18 09:48:52,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-02-18 09:48:52,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-02-18 09:48:52,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:52,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-02-18 09:48:52,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:52,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-18 09:48:52,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-02-18 09:48:52,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-02-18 09:48:52,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:52,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-02-18 09:48:52,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:52,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-18 09:48:52,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-02-18 09:48:52,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,751 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:48:52,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2019-02-18 09:48:52,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:52,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:48:52,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-02-18 09:48:52,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:48:52,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 09:48:52,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:34 [2019-02-18 09:48:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:48:52,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:48:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:48:52,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:48:52,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-18 09:48:52,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:48:52,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:48:52,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:48:52,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:48:52,929 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-02-18 09:48:59,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:48:59,765 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-02-18 09:48:59,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:48:59,766 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-02-18 09:48:59,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:48:59,766 INFO L225 Difference]: With dead ends: 71 [2019-02-18 09:48:59,766 INFO L226 Difference]: Without dead ends: 0 [2019-02-18 09:48:59,767 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-02-18 09:48:59,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-18 09:48:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-18 09:48:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-18 09:48:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-18 09:48:59,768 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-02-18 09:48:59,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:48:59,768 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-18 09:48:59,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:48:59,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-18 09:48:59,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-18 09:48:59,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-18 09:49:00,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:49:01,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:49:09,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:49:09,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:49:09,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:49:09,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:49:09,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:49:09,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:49:09,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:49:10,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:49:11,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:49:11,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:49:11,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:49:15,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:49:30,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:49:31,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:49:39,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:50:10,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:50:28,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:50:42,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:52:20,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent.