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-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:38:25,505 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:38:25,507 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:38:25,522 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:38:25,522 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:38:25,524 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:38:25,526 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:38:25,528 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:38:25,530 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:38:25,531 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:38:25,533 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:38:25,534 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:38:25,535 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:38:25,536 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:38:25,537 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:38:25,538 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:38:25,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:38:25,541 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:38:25,543 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:38:25,544 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:38:25,545 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:38:25,547 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:38:25,549 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:38:25,549 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:38:25,550 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:38:25,551 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:38:25,551 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:38:25,552 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:38:25,553 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:38:25,554 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:38:25,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:38:25,555 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:38:25,555 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:38:25,556 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:38:25,557 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:38:25,557 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:38:25,558 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:25,570 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:38:25,570 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:38:25,571 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:38:25,571 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:38:25,572 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:38:25,572 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:38:25,572 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:38:25,572 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:38:25,572 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-18 09:38:25,573 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:38:25,573 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-18 09:38:25,573 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-18 09:38:25,573 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:38:25,573 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:38:25,574 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:38:25,574 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:38:25,575 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:38:25,575 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:38:25,575 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:38:25,575 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:38:25,575 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:38:25,576 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:38:25,576 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:38:25,576 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:38:25,576 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:38:25,576 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:38:25,577 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:38:25,577 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:38:25,577 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:38:25,577 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:38:25,577 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:38:25,578 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:38:25,578 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:38:25,578 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:38:25,578 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:38:25,579 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:38:25,579 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:38:25,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:38:25,579 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:38:25,579 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:38:25,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:38:25,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:38:25,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:38:25,634 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:38:25,635 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:38:25,636 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl [2019-02-18 09:38:25,636 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl' [2019-02-18 09:38:25,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:38:25,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:38:25,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:38:25,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:38:25,679 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:38:25,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:25" (1/1) ... [2019-02-18 09:38:25,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:25" (1/1) ... [2019-02-18 09:38:25,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:38:25,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:38:25,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:38:25,734 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:38:25,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:25" (1/1) ... [2019-02-18 09:38:25,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:25" (1/1) ... [2019-02-18 09:38:25,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:25" (1/1) ... [2019-02-18 09:38:25,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:25" (1/1) ... [2019-02-18 09:38:25,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:25" (1/1) ... [2019-02-18 09:38:25,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:25" (1/1) ... [2019-02-18 09:38:25,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:25" (1/1) ... [2019-02-18 09:38:25,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:38:25,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:38:25,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:38:25,758 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:38:25,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:25" (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:25,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 09:38:25,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 09:38:26,171 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 09:38:26,172 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-02-18 09:38:26,173 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:38:26 BoogieIcfgContainer [2019-02-18 09:38:26,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:38:26,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:38:26,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:38:26,178 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:38:26,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:25" (1/2) ... [2019-02-18 09:38:26,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4174576a and model type speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:38:26, skipping insertion in model container [2019-02-18 09:38:26,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:38:26" (2/2) ... [2019-02-18 09:38:26,181 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-limited.bpl [2019-02-18 09:38:26,190 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:38:26,197 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-02-18 09:38:26,213 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-02-18 09:38:26,241 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:38:26,242 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:38:26,242 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:38:26,242 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:38:26,242 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:38:26,242 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:38:26,242 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:38:26,243 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:38:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-02-18 09:38:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-18 09:38:26,263 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:26,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-18 09:38:26,266 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:26,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:26,273 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-02-18 09:38:26,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:26,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:26,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:26,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:26,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:26,464 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:26,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:38:26,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:38:26,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:26,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:38:26,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:38:26,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:26,483 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-02-18 09:38:26,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:26,806 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-02-18 09:38:26,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:26,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-18 09:38:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:26,823 INFO L225 Difference]: With dead ends: 25 [2019-02-18 09:38:26,823 INFO L226 Difference]: Without dead ends: 20 [2019-02-18 09:38:26,827 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:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-18 09:38:26,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-02-18 09:38:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-18 09:38:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-02-18 09:38:26,865 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-02-18 09:38:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:26,867 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-02-18 09:38:26,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:38:26,867 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-02-18 09:38:26,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:26,868 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:26,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:26,869 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:26,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:26,869 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-02-18 09:38:26,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:26,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:26,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:26,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:26,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:27,142 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-18 09:38:27,164 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:27,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:27,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:27,166 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:38:27,167 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-02-18 09:38:27,213 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:27,214 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:27,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:27,277 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:27,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:27,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:27,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:27,283 INFO 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:27,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:27,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:27,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:27,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:27,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:27,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,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, 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:27,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,430 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:27,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:27,454 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,724 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,906 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:28,098 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:28,098 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:28,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:38:28,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:28,321 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:28,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:28,370 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:28,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:28,466 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:28,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:28,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:28,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:28,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:28,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:28,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:28,493 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-02-18 09:38:29,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:29,237 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-02-18 09:38:29,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:29,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 09:38:29,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:29,240 INFO L225 Difference]: With dead ends: 39 [2019-02-18 09:38:29,240 INFO L226 Difference]: Without dead ends: 37 [2019-02-18 09:38:29,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:38:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-18 09:38:29,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-02-18 09:38:29,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-18 09:38:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-02-18 09:38:29,247 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-02-18 09:38:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:29,247 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-02-18 09:38:29,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-02-18 09:38:29,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:29,248 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:29,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:29,249 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:29,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:29,249 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-02-18 09:38:29,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:29,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:29,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:29,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:29,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:29,342 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:29,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:29,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:29,343 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:38:29,343 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-02-18 09:38:29,344 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:29,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:29,353 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:29,354 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:29,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:29,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:29,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:29,354 INFO 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:29,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:29,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:29,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:29,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:29,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:29,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,561 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:29,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,575 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:29,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:29,596 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:29,633 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:29,653 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:29,666 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:29,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:29,699 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:29,699 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:29,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,754 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:29,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:29,835 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:29,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:29,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:29,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:29,892 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:29,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:38:29,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-18 09:38:29,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:29,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:38:29,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:38:29,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:29,912 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-02-18 09:38:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:30,000 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-02-18 09:38:30,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:30,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-18 09:38:30,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:30,003 INFO L225 Difference]: With dead ends: 18 [2019-02-18 09:38:30,003 INFO L226 Difference]: Without dead ends: 17 [2019-02-18 09:38:30,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:30,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-18 09:38:30,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-18 09:38:30,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 09:38:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-02-18 09:38:30,008 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-02-18 09:38:30,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:30,009 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-02-18 09:38:30,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:38:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-02-18 09:38:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:30,010 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:30,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:30,010 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:30,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:30,011 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-02-18 09:38:30,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:30,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:30,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:30,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:30,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:30,056 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,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:38:30,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:38:30,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:30,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:38:30,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:38:30,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:30,059 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-02-18 09:38:30,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:30,137 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-02-18 09:38:30,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:30,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 09:38:30,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:30,138 INFO L225 Difference]: With dead ends: 21 [2019-02-18 09:38:30,138 INFO L226 Difference]: Without dead ends: 20 [2019-02-18 09:38:30,139 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,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-18 09:38:30,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-02-18 09:38:30,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 09:38:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-02-18 09:38:30,145 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-02-18 09:38:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:30,145 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-02-18 09:38:30,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:38:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-02-18 09:38:30,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:30,150 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:30,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:30,151 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:30,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:30,151 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-02-18 09:38:30,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:30,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:30,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:30,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:30,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:30,278 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,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:30,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:30,278 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:38:30,278 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-02-18 09:38:30,280 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:30,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:30,287 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:30,288 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:30,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:30,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:30,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:30,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:30,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:30,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:30,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:30,309 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:30,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,315 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:30,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,324 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:30,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,370 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:30,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,391 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:30,392 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,431 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,511 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,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:30,542 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:30,543 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:30,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,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, 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:30,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,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:38:30,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:30,710 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,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:30,729 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,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:30,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:30,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:30,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:30,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:30,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:30,751 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-02-18 09:38:31,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:31,003 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-02-18 09:38:31,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:31,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 09:38:31,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:31,006 INFO L225 Difference]: With dead ends: 39 [2019-02-18 09:38:31,006 INFO L226 Difference]: Without dead ends: 38 [2019-02-18 09:38:31,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:38:31,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-18 09:38:31,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-02-18 09:38:31,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-18 09:38:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-02-18 09:38:31,013 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-02-18 09:38:31,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:31,013 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-02-18 09:38:31,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-02-18 09:38:31,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:31,014 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:31,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:31,014 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:31,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:31,015 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-02-18 09:38:31,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:31,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:31,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:31,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:31,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:31,152 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:31,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:31,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:31,153 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:31,153 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-02-18 09:38:31,155 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:31,155 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:31,162 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:31,162 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:31,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:31,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:31,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:31,163 INFO 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:31,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:31,174 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:31,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:31,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, 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:31,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,235 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:31,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:31,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:31,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,312 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:31,313 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,408 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,436 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,447 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,471 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:31,472 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:31,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:31,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,589 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:31,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:31,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,718 INFO L303 Elim1Store]: Index analysis took 106 ms [2019-02-18 09:38:31,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-18 09:38:31,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:31,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:38:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:31,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:31,831 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:31,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:31,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:31,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:31,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:31,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:31,850 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-02-18 09:38:32,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:32,401 INFO L93 Difference]: Finished difference Result 49 states and 91 transitions. [2019-02-18 09:38:32,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:32,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:32,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:32,403 INFO L225 Difference]: With dead ends: 49 [2019-02-18 09:38:32,404 INFO L226 Difference]: Without dead ends: 44 [2019-02-18 09:38:32,404 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:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-18 09:38:32,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 22. [2019-02-18 09:38:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-18 09:38:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-02-18 09:38:32,412 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-02-18 09:38:32,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:32,412 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-02-18 09:38:32,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-02-18 09:38:32,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:32,413 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:32,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:32,413 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:32,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:32,414 INFO L82 PathProgramCache]: Analyzing trace with hash 941028, now seen corresponding path program 1 times [2019-02-18 09:38:32,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:32,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:32,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:32,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:32,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:32,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:32,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:32,563 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:32,563 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-02-18 09:38:32,564 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:32,564 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:32,572 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:32,572 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:32,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:32,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:32,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:32,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 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:32,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:32,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:32,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:32,602 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:32,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:32,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,622 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:32,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:38:32,642 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,678 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,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,705 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,738 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,738 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:32,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,827 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:32,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,894 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:32,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:32,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,962 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:38:32,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:33,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:38:33,109 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:33,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:33,135 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:33,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:33,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:38:33,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:33,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:33,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:33,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:33,154 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-02-18 09:38:33,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:33,792 INFO L93 Difference]: Finished difference Result 47 states and 98 transitions. [2019-02-18 09:38:33,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:33,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:33,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:33,794 INFO L225 Difference]: With dead ends: 47 [2019-02-18 09:38:33,794 INFO L226 Difference]: Without dead ends: 46 [2019-02-18 09:38:33,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-18 09:38:33,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 24. [2019-02-18 09:38:33,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-18 09:38:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2019-02-18 09:38:33,803 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 70 transitions. Word has length 4 [2019-02-18 09:38:33,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:33,803 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 70 transitions. [2019-02-18 09:38:33,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 70 transitions. [2019-02-18 09:38:33,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:33,804 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:33,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:33,804 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:33,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:33,805 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-02-18 09:38:33,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:33,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:33,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:33,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:33,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:33,861 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,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:33,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:33,862 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:33,862 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-02-18 09:38:33,864 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:33,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:33,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:33,874 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:33,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:33,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:33,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:33,879 INFO 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:33,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:33,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:33,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:33,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:33,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:38:33,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:38:33,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,947 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:38:33,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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,968 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,989 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,001 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,012 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,022 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,040 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:34,041 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-18 09:38:34,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:34,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,112 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:34,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:34,128 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,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:34,137 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,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:38:34,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-18 09:38:34,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:34,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:38:34,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:38:34,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:34,157 INFO L87 Difference]: Start difference. First operand 24 states and 70 transitions. Second operand 4 states. [2019-02-18 09:38:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:34,297 INFO L93 Difference]: Finished difference Result 28 states and 79 transitions. [2019-02-18 09:38:34,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:34,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 09:38:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:34,298 INFO L225 Difference]: With dead ends: 28 [2019-02-18 09:38:34,298 INFO L226 Difference]: Without dead ends: 27 [2019-02-18 09:38:34,298 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:34,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-18 09:38:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-02-18 09:38:34,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-18 09:38:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2019-02-18 09:38:34,305 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 77 transitions. Word has length 4 [2019-02-18 09:38:34,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:34,306 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 77 transitions. [2019-02-18 09:38:34,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:38:34,306 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 77 transitions. [2019-02-18 09:38:34,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:34,307 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:34,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:34,307 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:34,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:34,307 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-02-18 09:38:34,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:34,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:34,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:34,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:34,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:34,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:34,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:34,421 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:34,421 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-02-18 09:38:34,422 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:34,422 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:34,429 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:34,430 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:34,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:34,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:34,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:34,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:34,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:34,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:34,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:34,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:34,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:38:34,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,486 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,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,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, 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,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:34,529 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,556 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,572 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,585 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,594 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,614 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:34,614 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:34,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,654 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:34,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:34,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:34,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,750 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:34,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:34,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,804 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:34,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:38:34,835 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:34,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:34,866 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:34,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:34,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:34,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:34,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:34,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:34,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:34,888 INFO L87 Difference]: Start difference. First operand 26 states and 77 transitions. Second operand 8 states. [2019-02-18 09:38:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:35,314 INFO L93 Difference]: Finished difference Result 44 states and 95 transitions. [2019-02-18 09:38:35,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:35,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:35,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:35,316 INFO L225 Difference]: With dead ends: 44 [2019-02-18 09:38:35,316 INFO L226 Difference]: Without dead ends: 43 [2019-02-18 09:38:35,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-18 09:38:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2019-02-18 09:38:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-18 09:38:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2019-02-18 09:38:35,325 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 70 transitions. Word has length 4 [2019-02-18 09:38:35,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:35,325 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 70 transitions. [2019-02-18 09:38:35,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 70 transitions. [2019-02-18 09:38:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:35,326 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:35,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:35,327 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:35,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:35,327 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-02-18 09:38:35,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:35,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:35,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:35,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:35,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:35,425 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,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:35,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:35,426 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:35,426 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-02-18 09:38:35,430 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:35,430 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:35,436 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:35,436 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:35,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:35,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:35,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:35,437 INFO 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:35,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:35,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:35,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:35,457 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:35,464 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:35,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:38:35,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:38:35,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,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, 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,507 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,539 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,551 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,561 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,571 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,585 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,586 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-18 09:38:35,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:38:35,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,649 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,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:35,663 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,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:35,675 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,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:35,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:35,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:35,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:35,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:35,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:35,695 INFO L87 Difference]: Start difference. First operand 25 states and 70 transitions. Second operand 6 states. [2019-02-18 09:38:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:35,903 INFO L93 Difference]: Finished difference Result 43 states and 96 transitions. [2019-02-18 09:38:35,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:35,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-18 09:38:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:35,904 INFO L225 Difference]: With dead ends: 43 [2019-02-18 09:38:35,905 INFO L226 Difference]: Without dead ends: 42 [2019-02-18 09:38:35,905 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:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-18 09:38:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2019-02-18 09:38:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-18 09:38:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 76 transitions. [2019-02-18 09:38:35,913 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 76 transitions. Word has length 4 [2019-02-18 09:38:35,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:35,913 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 76 transitions. [2019-02-18 09:38:35,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 76 transitions. [2019-02-18 09:38:35,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:35,914 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:35,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:35,914 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:35,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:35,914 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-02-18 09:38:35,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:35,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:35,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:35,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:35,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:36,031 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:36,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:36,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:36,032 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:36,032 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-02-18 09:38:36,033 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:36,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:36,038 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:36,039 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:36,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:36,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:36,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:36,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 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:36,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:36,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:36,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:36,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:36,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,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, 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:36,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,090 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:36,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,112 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:36,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,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, 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:36,122 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,155 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,191 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,220 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:36,221 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:36,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:36,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,334 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:36,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:36,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,371 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:36,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,428 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:36,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:36,454 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:36,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:36,480 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:36,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:36,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:36,500 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:36,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:36,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:36,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:36,502 INFO L87 Difference]: Start difference. First operand 26 states and 76 transitions. Second operand 8 states. [2019-02-18 09:38:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:36,998 INFO L93 Difference]: Finished difference Result 56 states and 123 transitions. [2019-02-18 09:38:36,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:36,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:36,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:37,000 INFO L225 Difference]: With dead ends: 56 [2019-02-18 09:38:37,001 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 09:38:37,001 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:37,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 09:38:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2019-02-18 09:38:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-18 09:38:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-02-18 09:38:37,010 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-02-18 09:38:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:37,010 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-02-18 09:38:37,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:37,011 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-02-18 09:38:37,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:37,011 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:37,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:37,012 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:37,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:37,012 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 2 times [2019-02-18 09:38:37,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:37,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:37,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:37,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:37,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:37,175 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,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:37,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:37,176 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:37,176 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:37,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:37,176 INFO 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:37,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:37,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:37,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-18 09:38:37,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:37,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:37,205 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:37,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,214 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:37,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,220 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:37,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:38:37,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,250 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:37,250 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,282 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,308 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,346 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:37,347 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:37,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:37,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,516 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:37,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:37,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,559 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:38:37,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,607 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:37,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:37,631 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,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:37,692 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:37,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:37,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:38:37,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:37,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:37,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:37,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:37,712 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 8 states. [2019-02-18 09:38:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:38,071 INFO L93 Difference]: Finished difference Result 66 states and 142 transitions. [2019-02-18 09:38:38,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:38,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:38,073 INFO L225 Difference]: With dead ends: 66 [2019-02-18 09:38:38,073 INFO L226 Difference]: Without dead ends: 64 [2019-02-18 09:38:38,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:38,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-18 09:38:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-02-18 09:38:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-18 09:38:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 99 transitions. [2019-02-18 09:38:38,083 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 99 transitions. Word has length 4 [2019-02-18 09:38:38,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:38,083 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 99 transitions. [2019-02-18 09:38:38,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:38,083 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 99 transitions. [2019-02-18 09:38:38,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:38,084 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:38,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:38,084 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:38,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:38,085 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-02-18 09:38:38,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:38,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:38,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:38,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:38,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:38,135 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,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:38,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:38,136 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:38,136 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [25] [2019-02-18 09:38:38,137 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:38,138 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:38,142 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:38,142 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:38,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:38,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:38,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:38,143 INFO 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:38,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:38,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:38,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:38,166 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,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,192 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,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,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, 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:38,211 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,242 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,258 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,270 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,281 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,302 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,303 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:38,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:38,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,388 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:38,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:38,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:38:38,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:38,420 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,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:38,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:38,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:38,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:38,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:38,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:38,442 INFO L87 Difference]: Start difference. First operand 32 states and 99 transitions. Second operand 6 states. [2019-02-18 09:38:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:38,622 INFO L93 Difference]: Finished difference Result 45 states and 113 transitions. [2019-02-18 09:38:38,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:38,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-18 09:38:38,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:38,623 INFO L225 Difference]: With dead ends: 45 [2019-02-18 09:38:38,623 INFO L226 Difference]: Without dead ends: 44 [2019-02-18 09:38:38,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:38:38,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-18 09:38:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-02-18 09:38:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-18 09:38:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 104 transitions. [2019-02-18 09:38:38,633 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 104 transitions. Word has length 4 [2019-02-18 09:38:38,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:38,633 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 104 transitions. [2019-02-18 09:38:38,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 104 transitions. [2019-02-18 09:38:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:38,634 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:38,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:38,634 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:38,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:38,635 INFO L82 PathProgramCache]: Analyzing trace with hash 947418, now seen corresponding path program 1 times [2019-02-18 09:38:38,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:38,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:38,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:38,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:38,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:38,665 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:38,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:38:38,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:38:38,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:38,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:38:38,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:38:38,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:38,666 INFO L87 Difference]: Start difference. First operand 33 states and 104 transitions. Second operand 3 states. [2019-02-18 09:38:38,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:38,696 INFO L93 Difference]: Finished difference Result 34 states and 104 transitions. [2019-02-18 09:38:38,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:38,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-18 09:38:38,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:38,697 INFO L225 Difference]: With dead ends: 34 [2019-02-18 09:38:38,697 INFO L226 Difference]: Without dead ends: 31 [2019-02-18 09:38:38,698 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:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-18 09:38:38,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-18 09:38:38,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-18 09:38:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 101 transitions. [2019-02-18 09:38:38,706 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 101 transitions. Word has length 4 [2019-02-18 09:38:38,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:38,706 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 101 transitions. [2019-02-18 09:38:38,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:38:38,707 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 101 transitions. [2019-02-18 09:38:38,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:38,707 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:38,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:38,708 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:38,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:38,708 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-02-18 09:38:38,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:38,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:38,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:38,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:38,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:38,813 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,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:38,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:38,814 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:38,814 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-02-18 09:38:38,815 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:38,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:38,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:38,820 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:38,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:38,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:38,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:38,820 INFO 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:38,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:38,833 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:38,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:38,847 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,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,855 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,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,866 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,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,889 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,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,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, 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:38,905 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,938 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,954 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,966 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,976 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,995 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,995 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:39,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:39,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,079 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:39,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:39,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,120 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:38:39,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,183 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:39,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:38:39,208 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,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:39,221 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:39,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:39,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:38:39,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:39,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:39,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:39,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:39,241 INFO L87 Difference]: Start difference. First operand 31 states and 101 transitions. Second operand 8 states. [2019-02-18 09:38:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:39,614 INFO L93 Difference]: Finished difference Result 59 states and 152 transitions. [2019-02-18 09:38:39,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:39,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:39,615 INFO L225 Difference]: With dead ends: 59 [2019-02-18 09:38:39,615 INFO L226 Difference]: Without dead ends: 58 [2019-02-18 09:38:39,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:39,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-18 09:38:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2019-02-18 09:38:39,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-18 09:38:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 119 transitions. [2019-02-18 09:38:39,625 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 119 transitions. Word has length 4 [2019-02-18 09:38:39,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:39,625 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 119 transitions. [2019-02-18 09:38:39,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:39,625 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 119 transitions. [2019-02-18 09:38:39,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:39,626 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:39,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:39,626 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:39,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:39,627 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-02-18 09:38:39,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:39,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:39,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:39,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:39,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:39,724 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:39,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:39,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:39,724 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:39,725 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-02-18 09:38:39,726 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:39,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:39,730 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:39,733 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:39,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:39,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:39,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:39,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:39,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:39,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:39,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:39,758 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:39,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:38:39,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,784 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:38:39,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:39,795 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,815 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,826 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,836 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,846 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,863 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,863 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-18 09:38:39,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:39,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,924 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,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:39,938 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:39,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:39,948 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:39,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:39,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:39,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:39,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:39,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:39,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:39,967 INFO L87 Difference]: Start difference. First operand 34 states and 119 transitions. Second operand 6 states. [2019-02-18 09:38:40,425 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-02-18 09:38:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:40,754 INFO L93 Difference]: Finished difference Result 51 states and 145 transitions. [2019-02-18 09:38:40,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:40,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-18 09:38:40,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:40,756 INFO L225 Difference]: With dead ends: 51 [2019-02-18 09:38:40,756 INFO L226 Difference]: Without dead ends: 50 [2019-02-18 09:38:40,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:38:40,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-18 09:38:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-02-18 09:38:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-18 09:38:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 125 transitions. [2019-02-18 09:38:40,765 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 125 transitions. Word has length 4 [2019-02-18 09:38:40,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:40,766 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 125 transitions. [2019-02-18 09:38:40,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 125 transitions. [2019-02-18 09:38:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:40,766 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:40,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:40,767 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:40,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:40,767 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-02-18 09:38:40,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:40,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:40,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:40,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:40,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:40,866 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,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:40,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:40,867 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:40,867 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-02-18 09:38:40,868 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:40,869 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:40,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:40,874 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:40,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:40,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:40,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:40,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 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:40,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:40,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:40,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:40,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:38:40,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,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, 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:40,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,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 23 treesize of output 37 [2019-02-18 09:38:40,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,930 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,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,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, 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:40,942 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,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:40,995 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,007 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,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:41,036 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:41,037 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:41,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,088 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:41,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,136 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:41,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:41,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:41,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,247 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,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:41,279 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,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:41,305 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:41,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:41,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:41,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:41,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:41,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:41,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:41,326 INFO L87 Difference]: Start difference. First operand 35 states and 125 transitions. Second operand 8 states. [2019-02-18 09:38:41,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:41,849 INFO L93 Difference]: Finished difference Result 64 states and 172 transitions. [2019-02-18 09:38:41,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:41,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:41,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:41,850 INFO L225 Difference]: With dead ends: 64 [2019-02-18 09:38:41,850 INFO L226 Difference]: Without dead ends: 63 [2019-02-18 09:38:41,851 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:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-18 09:38:41,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 37. [2019-02-18 09:38:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-18 09:38:41,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-02-18 09:38:41,862 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 4 [2019-02-18 09:38:41,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:41,862 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-02-18 09:38:41,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-02-18 09:38:41,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:41,863 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:41,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:41,863 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:41,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:41,863 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-02-18 09:38:41,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:41,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:41,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:41,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:41,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:42,002 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,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:42,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:42,003 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:42,003 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-02-18 09:38:42,004 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:42,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:42,008 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:42,008 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:42,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:42,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:42,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:42,009 INFO 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:42,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:42,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:42,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:42,030 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:42,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:42,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:38:42,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:38:42,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,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, 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:42,090 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,116 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,134 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,145 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,156 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,173 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:42,174 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:38:42,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,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, 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:42,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:42,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:42,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,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 33 treesize of output 59 [2019-02-18 09:38:42,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,350 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,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:42,368 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,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:42,389 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,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:42,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:42,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:42,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:42,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:42,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:42,410 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-02-18 09:38:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:42,733 INFO L93 Difference]: Finished difference Result 57 states and 164 transitions. [2019-02-18 09:38:42,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:42,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:42,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:42,735 INFO L225 Difference]: With dead ends: 57 [2019-02-18 09:38:42,735 INFO L226 Difference]: Without dead ends: 56 [2019-02-18 09:38:42,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-18 09:38:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-02-18 09:38:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 09:38:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 143 transitions. [2019-02-18 09:38:42,745 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 143 transitions. Word has length 5 [2019-02-18 09:38:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:42,746 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 143 transitions. [2019-02-18 09:38:42,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 143 transitions. [2019-02-18 09:38:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:42,746 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:42,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:42,747 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-02-18 09:38:42,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:42,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:42,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:42,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:42,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:42,896 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:42,896 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-02-18 09:38:42,897 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:42,897 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:42,901 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:42,901 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:38:42,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:42,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:42,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:42,902 INFO 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:42,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:42,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:42,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:42,919 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:42,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,930 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:42,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,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 23 treesize of output 37 [2019-02-18 09:38:42,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,018 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,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,134 INFO L303 Elim1Store]: Index analysis took 114 ms [2019-02-18 09:38:43,135 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:43,136 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,271 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,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,300 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,310 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,329 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:43,329 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:43,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,367 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:43,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,408 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,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:43,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,446 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:43,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,487 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,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:38:43,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,522 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:43,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,525 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:38:43,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,975 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:43,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:38:44,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:38:44,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:44,062 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:44,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:44,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:38:44,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:44,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:44,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:44,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:44,088 INFO L87 Difference]: Start difference. First operand 38 states and 143 transitions. Second operand 10 states. [2019-02-18 09:38:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:45,151 INFO L93 Difference]: Finished difference Result 68 states and 184 transitions. [2019-02-18 09:38:45,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:45,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:38:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:45,154 INFO L225 Difference]: With dead ends: 68 [2019-02-18 09:38:45,154 INFO L226 Difference]: Without dead ends: 67 [2019-02-18 09:38:45,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:38:45,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-18 09:38:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-02-18 09:38:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-18 09:38:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-02-18 09:38:45,174 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-02-18 09:38:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:45,174 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-02-18 09:38:45,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-02-18 09:38:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:45,175 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:45,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:45,180 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:45,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:45,180 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-02-18 09:38:45,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:45,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:45,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:45,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:45,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:45,522 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-18 09:38:45,550 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,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:45,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:45,551 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:45,551 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-02-18 09:38:45,552 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:45,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:45,556 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:45,556 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:45,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:45,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:45,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:45,557 INFO 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:45,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:45,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:45,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:45,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:45,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,586 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:45,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,596 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:45,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,607 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:45,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,686 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:45,687 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,715 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,744 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,773 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:45,773 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:45,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:38:45,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:45,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:45,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:38:45,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,941 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,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:38:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:45,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:45,980 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:45,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:45,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:45,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:46,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:46,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:46,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:46,000 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-02-18 09:38:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:46,371 INFO L93 Difference]: Finished difference Result 56 states and 158 transitions. [2019-02-18 09:38:46,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:46,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:46,372 INFO L225 Difference]: With dead ends: 56 [2019-02-18 09:38:46,372 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 09:38:46,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 09:38:46,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2019-02-18 09:38:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-18 09:38:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-02-18 09:38:46,383 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-02-18 09:38:46,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:46,383 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-02-18 09:38:46,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-02-18 09:38:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:46,384 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:46,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:46,384 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:46,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:46,385 INFO L82 PathProgramCache]: Analyzing trace with hash 29189286, now seen corresponding path program 1 times [2019-02-18 09:38:46,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:46,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:46,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:46,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:46,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:46,420 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:46,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:46,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:46,420 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:46,420 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-02-18 09:38:46,421 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:46,422 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:46,426 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:46,426 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:46,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:46,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:46,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:46,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:46,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:46,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:46,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:46,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:46,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:46,465 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:38:46,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-18 09:38:46,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-18 09:38:46,503 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,516 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,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,535 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,545 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,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:46,560 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-02-18 09:38:46,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:46,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,610 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:46,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:38:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:46,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:46,699 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:46,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:46,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:46,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:46,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:46,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:46,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:46,720 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 6 states. [2019-02-18 09:38:46,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:46,857 INFO L93 Difference]: Finished difference Result 45 states and 143 transitions. [2019-02-18 09:38:46,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:46,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-18 09:38:46,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:46,859 INFO L225 Difference]: With dead ends: 45 [2019-02-18 09:38:46,859 INFO L226 Difference]: Without dead ends: 44 [2019-02-18 09:38:46,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:38:46,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-18 09:38:46,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-02-18 09:38:46,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-18 09:38:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 138 transitions. [2019-02-18 09:38:46,870 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 138 transitions. Word has length 5 [2019-02-18 09:38:46,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:46,870 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 138 transitions. [2019-02-18 09:38:46,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 138 transitions. [2019-02-18 09:38:46,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:46,871 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:46,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:46,871 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:46,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:46,872 INFO L82 PathProgramCache]: Analyzing trace with hash 29175208, now seen corresponding path program 1 times [2019-02-18 09:38:46,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:46,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:46,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:46,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:46,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:46,999 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:46,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:46,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:46,999 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:47,000 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [23] [2019-02-18 09:38:47,000 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:47,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:47,003 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:47,004 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:38:47,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:47,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:47,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:47,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:47,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:47,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:47,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:47,030 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,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:47,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:38:47,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,052 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:47,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:47,069 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,117 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,132 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,144 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,154 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,175 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:47,175 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:47,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,214 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:47,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,254 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:47,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:47,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,292 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:47,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:47,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,335 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,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:38:47,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-02-18 09:38:47,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,428 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,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:38:47,444 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:47,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:47,485 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:47,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:47,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:38:47,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:47,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:47,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:47,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:47,506 INFO L87 Difference]: Start difference. First operand 39 states and 138 transitions. Second operand 10 states. [2019-02-18 09:38:48,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:48,113 INFO L93 Difference]: Finished difference Result 71 states and 207 transitions. [2019-02-18 09:38:48,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:48,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:38:48,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:48,117 INFO L225 Difference]: With dead ends: 71 [2019-02-18 09:38:48,117 INFO L226 Difference]: Without dead ends: 70 [2019-02-18 09:38:48,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:38:48,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-18 09:38:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2019-02-18 09:38:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-18 09:38:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 144 transitions. [2019-02-18 09:38:48,128 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 144 transitions. Word has length 5 [2019-02-18 09:38:48,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:48,128 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 144 transitions. [2019-02-18 09:38:48,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:48,129 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 144 transitions. [2019-02-18 09:38:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:48,129 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:48,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:48,129 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:48,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:48,130 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-02-18 09:38:48,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:48,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:48,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:48,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:48,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:48,245 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,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:48,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:48,246 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:48,246 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-02-18 09:38:48,247 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:48,247 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:48,251 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:48,251 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:48,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:48,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:48,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:48,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 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:48,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:48,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:48,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:48,277 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:48,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:48,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:38:48,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:38:48,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:38:48,316 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,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:48,352 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,361 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,373 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,391 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:48,392 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:38:48,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,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, 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:48,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,467 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:48,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:48,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,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, 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:48,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,605 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,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:48,622 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,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:48,645 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,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:48,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:48,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:48,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:48,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:48,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:48,666 INFO L87 Difference]: Start difference. First operand 40 states and 144 transitions. Second operand 8 states. [2019-02-18 09:38:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:48,977 INFO L93 Difference]: Finished difference Result 59 states and 171 transitions. [2019-02-18 09:38:48,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:48,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:48,979 INFO L225 Difference]: With dead ends: 59 [2019-02-18 09:38:48,979 INFO L226 Difference]: Without dead ends: 58 [2019-02-18 09:38:48,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-18 09:38:48,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2019-02-18 09:38:48,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-18 09:38:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-18 09:38:48,991 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-02-18 09:38:48,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:48,991 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-18 09:38:48,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-18 09:38:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:48,992 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:48,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:48,992 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:48,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:48,992 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-02-18 09:38:48,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:48,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:48,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:48,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:48,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:49,153 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 21 [2019-02-18 09:38:49,302 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2019-02-18 09:38:49,331 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:49,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:49,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:49,332 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:49,332 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-02-18 09:38:49,333 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:49,333 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:49,337 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:49,337 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:38:49,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:49,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:49,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:49,338 INFO 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:38:49,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:49,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:49,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:49,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:49,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,372 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,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,377 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,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,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, 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,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,399 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,400 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:49,432 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,446 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,457 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,467 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,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:49,486 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:49,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,523 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:49,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:49,581 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:49,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:49,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-18 09:38:49,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:49,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:38:49,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:38:49,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,734 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:49,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,737 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:38:49,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:49,816 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:49,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:38:49,847 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:49,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:49,886 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:49,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:49,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:38:49,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:49,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:49,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:49,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:49,906 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-02-18 09:38:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:50,652 INFO L93 Difference]: Finished difference Result 71 states and 197 transitions. [2019-02-18 09:38:50,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:50,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:38:50,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:50,654 INFO L225 Difference]: With dead ends: 71 [2019-02-18 09:38:50,654 INFO L226 Difference]: Without dead ends: 70 [2019-02-18 09:38:50,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:38:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-18 09:38:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-02-18 09:38:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 09:38:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 132 transitions. [2019-02-18 09:38:50,663 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 132 transitions. Word has length 5 [2019-02-18 09:38:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:50,664 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 132 transitions. [2019-02-18 09:38:50,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 132 transitions. [2019-02-18 09:38:50,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:50,664 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:50,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:50,664 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:50,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:50,665 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-02-18 09:38:50,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:50,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:50,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:50,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:50,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:50,771 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:50,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:50,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:50,772 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:50,772 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-02-18 09:38:50,773 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:50,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:50,776 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:50,776 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:50,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:50,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:50,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:50,777 INFO 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:38:50,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:50,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:50,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:50,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:38:50,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,840 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:50,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:50,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,877 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:50,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,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, 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:50,885 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,912 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,926 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,938 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,948 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,965 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:50,965 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:50,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,993 INFO L701 Elim1Store]: detected not equals via solver [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,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:50,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,000 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:51,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,044 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,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:51,236 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-02-18 09:38:51,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,526 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:51,527 INFO L303 Elim1Store]: Index analysis took 287 ms [2019-02-18 09:38:51,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, 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:38:51,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,081 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:52,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:52,276 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:52,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:52,373 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:52,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:52,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:52,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:52,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:52,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:52,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:52,393 INFO L87 Difference]: Start difference. First operand 38 states and 132 transitions. Second operand 8 states. [2019-02-18 09:38:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:52,739 INFO L93 Difference]: Finished difference Result 66 states and 183 transitions. [2019-02-18 09:38:52,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:52,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:52,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:52,740 INFO L225 Difference]: With dead ends: 66 [2019-02-18 09:38:52,740 INFO L226 Difference]: Without dead ends: 65 [2019-02-18 09:38:52,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-18 09:38:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2019-02-18 09:38:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-18 09:38:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-18 09:38:52,753 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-02-18 09:38:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:52,753 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-18 09:38:52,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-18 09:38:52,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:52,754 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:52,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:52,754 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:52,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:52,755 INFO L82 PathProgramCache]: Analyzing trace with hash 29231070, now seen corresponding path program 1 times [2019-02-18 09:38:52,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:52,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:52,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:52,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:52,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:52,901 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,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:52,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:52,901 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:52,901 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [23] [2019-02-18 09:38:52,902 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:52,902 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:52,906 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:52,906 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:38:52,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:52,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:52,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:52,907 INFO 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:38:52,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:52,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:52,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:52,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:52,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,933 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,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,941 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,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:38:52,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:38:52,961 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,988 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,003 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,015 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,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:38:53,044 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:53,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,081 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:53,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,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:38:53,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:53,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,159 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:53,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:38:53,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,237 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:53,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:53,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:53,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,333 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:53,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:53,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:53,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:53,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:53,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:38:53,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:53,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:53,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:53,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:53,410 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-02-18 09:38:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:54,039 INFO L93 Difference]: Finished difference Result 93 states and 253 transitions. [2019-02-18 09:38:54,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:54,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:38:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:54,041 INFO L225 Difference]: With dead ends: 93 [2019-02-18 09:38:54,041 INFO L226 Difference]: Without dead ends: 92 [2019-02-18 09:38:54,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:54,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-18 09:38:54,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2019-02-18 09:38:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-18 09:38:54,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 192 transitions. [2019-02-18 09:38:54,053 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 192 transitions. Word has length 5 [2019-02-18 09:38:54,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:54,053 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 192 transitions. [2019-02-18 09:38:54,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:54,054 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 192 transitions. [2019-02-18 09:38:54,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:54,054 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:54,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:54,054 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:54,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:54,055 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-02-18 09:38:54,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:54,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:54,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:54,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:54,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:54,212 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-18 09:38:54,215 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:54,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:54,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:54,216 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:54,216 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-02-18 09:38:54,217 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:54,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:54,220 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:54,220 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:54,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:54,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:54,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:54,221 INFO 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:38:54,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:54,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:54,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:54,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:38:54,313 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:54,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, 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:38:54,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,488 INFO L303 Elim1Store]: Index analysis took 105 ms [2019-02-18 09:38:54,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-18 09:38:54,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-18 09:38:54,505 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,520 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,540 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,564 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:54,564 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-02-18 09:38:54,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 09:38:54,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,606 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:54,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:38:54,617 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:54,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:54,626 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:54,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:38:54,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-18 09:38:54,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:54,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:38:54,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:38:54,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:54,646 INFO L87 Difference]: Start difference. First operand 48 states and 192 transitions. Second operand 4 states. [2019-02-18 09:38:54,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:54,690 INFO L93 Difference]: Finished difference Result 56 states and 215 transitions. [2019-02-18 09:38:54,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:54,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-18 09:38:54,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:54,691 INFO L225 Difference]: With dead ends: 56 [2019-02-18 09:38:54,692 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 09:38:54,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:54,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 09:38:54,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-02-18 09:38:54,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-18 09:38:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 211 transitions. [2019-02-18 09:38:54,706 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 211 transitions. Word has length 5 [2019-02-18 09:38:54,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:54,707 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 211 transitions. [2019-02-18 09:38:54,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:38:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 211 transitions. [2019-02-18 09:38:54,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:54,707 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:54,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:54,707 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:54,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:54,707 INFO L82 PathProgramCache]: Analyzing trace with hash 29235350, now seen corresponding path program 1 times [2019-02-18 09:38:54,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:54,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:54,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:54,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:54,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:54,767 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:54,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:54,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:54,768 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:54,768 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-02-18 09:38:54,769 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:54,769 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:54,772 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:54,772 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:54,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:54,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:54,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:54,773 INFO 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:38:54,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:54,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:54,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:54,789 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:54,795 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:54,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:38:54,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,819 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:38:54,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:54,832 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,852 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:54,901 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-18 09:38:55,784 WARN L181 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-18 09:38:55,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:55,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,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:38:55,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:55,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,877 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:38:55,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,907 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:55,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:55,923 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:55,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:55,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:55,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:55,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:55,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:55,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:55,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:55,961 INFO L87 Difference]: Start difference. First operand 52 states and 211 transitions. Second operand 8 states. [2019-02-18 09:38:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:56,339 INFO L93 Difference]: Finished difference Result 85 states and 266 transitions. [2019-02-18 09:38:56,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:56,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:56,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:56,340 INFO L225 Difference]: With dead ends: 85 [2019-02-18 09:38:56,340 INFO L226 Difference]: Without dead ends: 84 [2019-02-18 09:38:56,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:38:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-18 09:38:56,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2019-02-18 09:38:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-18 09:38:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 223 transitions. [2019-02-18 09:38:56,357 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 223 transitions. Word has length 5 [2019-02-18 09:38:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:56,357 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 223 transitions. [2019-02-18 09:38:56,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:56,358 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 223 transitions. [2019-02-18 09:38:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:56,358 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:56,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:56,358 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:56,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:56,359 INFO L82 PathProgramCache]: Analyzing trace with hash 29235038, now seen corresponding path program 1 times [2019-02-18 09:38:56,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:56,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:56,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:56,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:56,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:56,523 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,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:56,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:56,524 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:56,525 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [23] [2019-02-18 09:38:56,527 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:56,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:56,530 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:56,530 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:38:56,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:56,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:56,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:56,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:56,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:56,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:56,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:56,548 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:56,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,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, 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:56,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,559 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:56,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:56,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,581 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:56,581 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,609 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,637 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,666 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:56,666 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:56,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:38:56,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,745 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:56,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:56,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:56,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,827 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:56,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:56,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,866 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:56,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:38:56,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,965 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:56,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:38:57,000 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:57,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:57,039 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:57,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:57,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:38:57,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:57,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:57,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:57,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:57,060 INFO L87 Difference]: Start difference. First operand 54 states and 223 transitions. Second operand 10 states. [2019-02-18 09:38:57,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:57,872 INFO L93 Difference]: Finished difference Result 96 states and 303 transitions. [2019-02-18 09:38:57,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:57,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:38:57,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:57,874 INFO L225 Difference]: With dead ends: 96 [2019-02-18 09:38:57,874 INFO L226 Difference]: Without dead ends: 94 [2019-02-18 09:38:57,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:38:57,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-18 09:38:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2019-02-18 09:38:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 09:38:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-02-18 09:38:57,890 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-02-18 09:38:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:57,891 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-02-18 09:38:57,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-02-18 09:38:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:57,891 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:57,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:57,891 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:57,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:57,892 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-02-18 09:38:57,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:57,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:57,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:57,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:57,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:58,045 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:58,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:58,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:58,045 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:58,045 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-02-18 09:38:58,046 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:58,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:58,050 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:58,050 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:58,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:58,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:58,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:58,051 INFO 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:38:58,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:58,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:58,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:58,071 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:58,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:58,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:38:58,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:38:58,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,123 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:58,123 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,145 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,156 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,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:58,177 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,193 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,194 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:38:58,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:58,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,268 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,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:58,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,292 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:58,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:38:58,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,323 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,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:58,339 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:58,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:58,361 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:58,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:58,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:58,381 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:58,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:58,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:58,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:58,382 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-02-18 09:38:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:58,698 INFO L93 Difference]: Finished difference Result 82 states and 289 transitions. [2019-02-18 09:38:58,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:58,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:58,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:58,700 INFO L225 Difference]: With dead ends: 82 [2019-02-18 09:38:58,701 INFO L226 Difference]: Without dead ends: 81 [2019-02-18 09:38:58,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:58,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-18 09:38:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2019-02-18 09:38:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 09:38:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-02-18 09:38:58,720 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-02-18 09:38:58,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:58,720 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-02-18 09:38:58,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:58,720 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-02-18 09:38:58,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:58,720 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:58,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:58,721 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:58,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:58,721 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-02-18 09:38:58,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:58,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:58,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:58,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:58,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:58,819 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:58,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:58,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:58,820 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:58,820 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-02-18 09:38:58,821 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:58,821 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:58,825 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:58,825 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:58,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:58,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:58,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:58,826 INFO 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:38:58,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:58,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:58,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:58,846 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:58,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,849 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:58,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,908 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:58,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,990 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:58,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,001 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:59,002 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,030 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,045 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,057 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,067 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,086 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:59,086 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-18 09:38:59,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:38:59,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,165 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:59,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:59,288 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-02-18 09:38:59,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,329 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:59,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,377 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:59,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:38:59,394 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,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:59,406 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:59,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:59,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:38:59,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:59,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:59,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:59,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:59,425 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-02-18 09:38:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:59,742 INFO L93 Difference]: Finished difference Result 87 states and 319 transitions. [2019-02-18 09:38:59,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:59,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:59,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:59,745 INFO L225 Difference]: With dead ends: 87 [2019-02-18 09:38:59,745 INFO L226 Difference]: Without dead ends: 86 [2019-02-18 09:38:59,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-18 09:38:59,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-02-18 09:38:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-18 09:38:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 302 transitions. [2019-02-18 09:38:59,763 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 302 transitions. Word has length 5 [2019-02-18 09:38:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:59,763 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 302 transitions. [2019-02-18 09:38:59,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 302 transitions. [2019-02-18 09:38:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:59,764 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:59,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:59,765 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:59,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:59,765 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-02-18 09:38:59,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:59,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:59,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:59,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:59,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:59,896 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:59,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:59,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:59,897 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:59,897 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-02-18 09:38:59,899 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:59,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:59,902 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:59,902 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:59,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:59,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:59,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:59,902 INFO 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:38:59,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:59,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:59,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:59,925 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,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,927 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:59,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,933 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:59,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,939 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:59,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:59,948 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,976 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,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,030 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,040 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,059 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,059 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:00,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,090 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:00,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,133 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:00,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:00,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,167 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:00,168 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:00,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,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:39:00,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:00,236 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:00,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:00,258 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:00,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:00,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:00,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:00,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:00,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:00,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:00,279 INFO L87 Difference]: Start difference. First operand 67 states and 302 transitions. Second operand 8 states. [2019-02-18 09:39:00,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:00,618 INFO L93 Difference]: Finished difference Result 86 states and 334 transitions. [2019-02-18 09:39:00,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:39:00,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:39:00,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:00,620 INFO L225 Difference]: With dead ends: 86 [2019-02-18 09:39:00,621 INFO L226 Difference]: Without dead ends: 85 [2019-02-18 09:39:00,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-18 09:39:00,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2019-02-18 09:39:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-18 09:39:00,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 314 transitions. [2019-02-18 09:39:00,645 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 314 transitions. Word has length 5 [2019-02-18 09:39:00,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:00,646 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 314 transitions. [2019-02-18 09:39:00,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 314 transitions. [2019-02-18 09:39:00,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:39:00,646 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:00,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:39:00,646 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:00,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:00,647 INFO L82 PathProgramCache]: Analyzing trace with hash 28947050, now seen corresponding path program 2 times [2019-02-18 09:39:00,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:00,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:00,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:00,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:00,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:00,930 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-02-18 09:39:01,229 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-18 09:39:01,301 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:01,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:01,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:01,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:01,302 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:01,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:01,302 INFO 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:01,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:39:01,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:39:01,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-18 09:39:01,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:01,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:01,320 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:01,338 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:01,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:39:01,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:39:01,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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,364 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:01,382 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,394 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,404 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,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:01,431 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,431 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-18 09:39:01,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:01,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:01,489 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:01,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:39:01,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,516 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:01,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:01,545 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,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:39:01,561 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:01,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:01,575 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:01,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:01,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:39:01,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:01,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:01,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:01,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:39:01,595 INFO L87 Difference]: Start difference. First operand 69 states and 314 transitions. Second operand 8 states. [2019-02-18 09:39:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:02,538 INFO L93 Difference]: Finished difference Result 110 states and 397 transitions. [2019-02-18 09:39:02,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:39:02,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:39:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:02,540 INFO L225 Difference]: With dead ends: 110 [2019-02-18 09:39:02,540 INFO L226 Difference]: Without dead ends: 107 [2019-02-18 09:39:02,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:02,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-18 09:39:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 78. [2019-02-18 09:39:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-18 09:39:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 360 transitions. [2019-02-18 09:39:02,569 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 360 transitions. Word has length 5 [2019-02-18 09:39:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:02,569 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 360 transitions. [2019-02-18 09:39:02,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 360 transitions. [2019-02-18 09:39:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:39:02,570 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:02,571 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:39:02,571 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:02,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:02,571 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-02-18 09:39:02,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:02,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:02,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:39:02,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:02,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:02,698 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:02,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:02,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:02,698 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:39:02,699 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [27] [2019-02-18 09:39:02,700 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:02,700 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:02,702 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:02,703 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:39:02,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:02,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:02,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:02,703 INFO 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:02,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:02,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:02,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:02,721 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:02,727 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:02,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:39:02,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:39:02,753 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,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, 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:02,762 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,783 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,796 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,808 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,819 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,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:02,838 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-18 09:39:02,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:02,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,913 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:02,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:39:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:02,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:02,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:02,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:39:02,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:02,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:39:02,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:39:02,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:39:02,959 INFO L87 Difference]: Start difference. First operand 78 states and 360 transitions. Second operand 6 states. [2019-02-18 09:39:03,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:03,218 INFO L93 Difference]: Finished difference Result 87 states and 367 transitions. [2019-02-18 09:39:03,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:39:03,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-18 09:39:03,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:03,220 INFO L225 Difference]: With dead ends: 87 [2019-02-18 09:39:03,221 INFO L226 Difference]: Without dead ends: 86 [2019-02-18 09:39:03,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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:39:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-18 09:39:03,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-02-18 09:39:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-18 09:39:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 357 transitions. [2019-02-18 09:39:03,241 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 357 transitions. Word has length 5 [2019-02-18 09:39:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:03,241 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 357 transitions. [2019-02-18 09:39:03,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:39:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 357 transitions. [2019-02-18 09:39:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:39:03,242 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:03,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:39:03,242 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:03,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:03,242 INFO L82 PathProgramCache]: Analyzing trace with hash 29052324, now seen corresponding path program 1 times [2019-02-18 09:39:03,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:03,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:03,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:03,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:03,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:03,383 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,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:03,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:03,383 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:39:03,383 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [23] [2019-02-18 09:39:03,384 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:03,384 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:03,386 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:03,387 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:03,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:03,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:03,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:03,387 INFO 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:03,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:03,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:03,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:03,405 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:03,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,408 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:03,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,413 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:03,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:39:03,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:03,428 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:03,455 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:03,470 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:03,481 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:03,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:03,510 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:03,511 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:03,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:03,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:03,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:39:03,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:03,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,650 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:03,651 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:03,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:03,693 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:03,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:03,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 09:39:03,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:03,779 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:03,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:03,800 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,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:03,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:03,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:39:03,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:03,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:03,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:03,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:39:03,853 INFO L87 Difference]: Start difference. First operand 76 states and 357 transitions. Second operand 10 states. [2019-02-18 09:39:04,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:04,430 INFO L93 Difference]: Finished difference Result 133 states and 461 transitions. [2019-02-18 09:39:04,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:39:04,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:39:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:04,434 INFO L225 Difference]: With dead ends: 133 [2019-02-18 09:39:04,434 INFO L226 Difference]: Without dead ends: 132 [2019-02-18 09:39:04,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:39:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-02-18 09:39:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 75. [2019-02-18 09:39:04,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-18 09:39:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 351 transitions. [2019-02-18 09:39:04,454 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 351 transitions. Word has length 5 [2019-02-18 09:39:04,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:04,455 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 351 transitions. [2019-02-18 09:39:04,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:04,455 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 351 transitions. [2019-02-18 09:39:04,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:39:04,455 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:04,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:39:04,456 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:04,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:04,456 INFO L82 PathProgramCache]: Analyzing trace with hash 29056604, now seen corresponding path program 1 times [2019-02-18 09:39:04,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:04,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:04,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:04,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:04,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:04,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:04,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:04,598 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:39:04,599 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-02-18 09:39:04,599 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:04,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:04,602 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:04,602 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:04,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:04,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:04,603 INFO 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:04,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:04,614 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:04,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:04,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:04,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:04,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:39:04,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,642 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:39:04,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,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, 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:04,653 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,672 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,684 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,694 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,704 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,721 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,721 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-18 09:39:04,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:04,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,784 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,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:39:04,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:04,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,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:39:04,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:39:04,856 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,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:04,874 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:04,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:04,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:04,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:04,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:04,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:04,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:04,894 INFO L87 Difference]: Start difference. First operand 75 states and 351 transitions. Second operand 8 states. [2019-02-18 09:39:05,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:05,233 INFO L93 Difference]: Finished difference Result 113 states and 411 transitions. [2019-02-18 09:39:05,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:05,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:39:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:05,236 INFO L225 Difference]: With dead ends: 113 [2019-02-18 09:39:05,236 INFO L226 Difference]: Without dead ends: 112 [2019-02-18 09:39:05,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:39:05,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-18 09:39:05,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2019-02-18 09:39:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-18 09:39:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 363 transitions. [2019-02-18 09:39:05,260 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 363 transitions. Word has length 5 [2019-02-18 09:39:05,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:05,261 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 363 transitions. [2019-02-18 09:39:05,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 363 transitions. [2019-02-18 09:39:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:05,262 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:05,262 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-18 09:39:05,262 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:05,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:05,262 INFO L82 PathProgramCache]: Analyzing trace with hash 904669396, now seen corresponding path program 2 times [2019-02-18 09:39:05,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:05,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:05,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:05,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:05,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:05,358 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:05,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:05,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:05,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:05,359 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:05,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:05,359 INFO 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:05,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:39:05,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:39:05,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:39:05,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:05,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:05,380 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,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,394 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:05,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:05,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:39:05,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:05,422 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:05,453 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,468 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,480 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,490 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,515 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:05,515 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:05,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,577 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:05,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:05,618 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:05,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:05,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 78 [2019-02-18 09:39:05,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:05,699 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:05,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-02-18 09:39:05,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,739 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:39:05,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:05,785 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:05,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:05,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:05,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 110 [2019-02-18 09:39:05,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:05,881 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,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:05,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:05,948 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:39:05,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:05,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:39:05,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:05,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:39:05,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:39:05,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:39:05,967 INFO L87 Difference]: Start difference. First operand 77 states and 363 transitions. Second operand 11 states. [2019-02-18 09:39:06,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:06,737 INFO L93 Difference]: Finished difference Result 136 states and 478 transitions. [2019-02-18 09:39:06,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:06,738 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-18 09:39:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:06,740 INFO L225 Difference]: With dead ends: 136 [2019-02-18 09:39:06,740 INFO L226 Difference]: Without dead ends: 131 [2019-02-18 09:39:06,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:39:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-18 09:39:06,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 77. [2019-02-18 09:39:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-18 09:39:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-02-18 09:39:06,764 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-02-18 09:39:06,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:06,764 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-02-18 09:39:06,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:39:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-02-18 09:39:06,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:06,765 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:06,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:06,765 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:06,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:06,765 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-02-18 09:39:06,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:06,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:06,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:39:06,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:06,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:07,030 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-18 09:39:07,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:39:07,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:07,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:07,093 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:07,093 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-02-18 09:39:07,094 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:07,094 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:07,097 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:07,097 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:07,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:07,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:07,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:07,098 INFO 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:07,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:07,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:07,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:07,116 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:07,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:07,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,132 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,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,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, 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:07,181 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,207 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,222 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,234 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,244 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,261 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:07,261 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:07,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:07,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,347 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:07,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:07,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:07,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,460 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:07,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:07,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,531 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:07,531 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:07,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,592 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:07,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:07,622 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,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:07,678 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:07,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:07,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:39:07,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:07,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:07,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:07,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:39:07,697 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 10 states. [2019-02-18 09:39:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:08,203 INFO L93 Difference]: Finished difference Result 106 states and 409 transitions. [2019-02-18 09:39:08,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:08,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:39:08,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:08,205 INFO L225 Difference]: With dead ends: 106 [2019-02-18 09:39:08,205 INFO L226 Difference]: Without dead ends: 105 [2019-02-18 09:39:08,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:08,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-18 09:39:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2019-02-18 09:39:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-18 09:39:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-02-18 09:39:08,227 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-02-18 09:39:08,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:08,228 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-02-18 09:39:08,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:08,228 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-02-18 09:39:08,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:08,228 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:08,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:08,229 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:08,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:08,230 INFO L82 PathProgramCache]: Analyzing trace with hash 904728978, now seen corresponding path program 1 times [2019-02-18 09:39:08,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:08,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:08,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:08,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:08,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:08,684 WARN L181 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-18 09:39:08,791 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:08,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:08,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:08,791 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:08,792 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [23] [2019-02-18 09:39:08,793 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:08,793 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:08,796 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:08,796 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:39:08,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:08,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:08,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:08,797 INFO 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:08,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:08,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:08,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:08,819 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:08,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:08,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:08,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,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, 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:08,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:08,861 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,889 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,916 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,945 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:08,945 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:08,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,982 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:08,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:09,021 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:09,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:09,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,060 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:09,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:09,121 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:09,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:09,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,163 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:09,164 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:09,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:09,229 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:09,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:09,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,265 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:09,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:39:09,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:09,315 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:09,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:39:09,340 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:09,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:09,397 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:39:09,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:09,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:39:09,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:09,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:39:09,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:39:09,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:09,416 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-02-18 09:39:10,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:10,149 INFO L93 Difference]: Finished difference Result 131 states and 463 transitions. [2019-02-18 09:39:10,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:10,150 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-18 09:39:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:10,151 INFO L225 Difference]: With dead ends: 131 [2019-02-18 09:39:10,151 INFO L226 Difference]: Without dead ends: 130 [2019-02-18 09:39:10,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:39:10,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-18 09:39:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2019-02-18 09:39:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-18 09:39:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-02-18 09:39:10,172 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-02-18 09:39:10,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:10,172 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-02-18 09:39:10,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:39:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-02-18 09:39:10,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:10,173 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:10,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:10,173 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:10,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:10,174 INFO L82 PathProgramCache]: Analyzing trace with hash 904746776, now seen corresponding path program 1 times [2019-02-18 09:39:10,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:10,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:10,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:10,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:10,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:10,250 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,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:10,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:10,251 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:10,251 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-02-18 09:39:10,252 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:10,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:10,255 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:10,256 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:10,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:10,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:10,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:10,257 INFO 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:10,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:10,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:10,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:10,273 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:10,275 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:10,284 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:10,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-18 09:39:10,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-18 09:39:10,315 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,330 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,350 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,360 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,374 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:10,375 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-18 09:39:10,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:10,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,419 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:10,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:39:10,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-02-18 09:39:10,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,454 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:10,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-18 09:39:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:10,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:10,488 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:10,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:10,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:10,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:10,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:10,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:10,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:10,508 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 8 states. [2019-02-18 09:39:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:10,744 INFO L93 Difference]: Finished difference Result 93 states and 382 transitions. [2019-02-18 09:39:10,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:39:10,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:39:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:10,746 INFO L225 Difference]: With dead ends: 93 [2019-02-18 09:39:10,746 INFO L226 Difference]: Without dead ends: 92 [2019-02-18 09:39:10,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 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:10,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-18 09:39:10,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2019-02-18 09:39:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-18 09:39:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-02-18 09:39:10,769 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-02-18 09:39:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:10,770 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-02-18 09:39:10,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:10,770 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-02-18 09:39:10,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:10,770 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:10,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:10,770 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:10,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:10,770 INFO L82 PathProgramCache]: Analyzing trace with hash 904732946, now seen corresponding path program 1 times [2019-02-18 09:39:10,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:10,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:10,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:10,979 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:10,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:10,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:10,980 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:10,980 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [23] [2019-02-18 09:39:10,981 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:10,981 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:10,984 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:10,984 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:39:10,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:10,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:10,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:10,985 INFO 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:10,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:10,994 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:11,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:11,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:11,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,016 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:11,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,022 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:11,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,035 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,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,049 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:11,049 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,076 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,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,103 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,113 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,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,132 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:11,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,169 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:11,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,210 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:11,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:11,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,462 INFO L303 Elim1Store]: Index analysis took 231 ms [2019-02-18 09:39:11,463 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:11,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,511 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:11,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:11,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,548 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:11,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:39:11,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,602 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,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-02-18 09:39:11,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,643 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:11,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-02-18 09:39:11,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,694 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:11,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:39:11,734 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:11,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:11,799 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:39:11,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:11,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:39:11,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:11,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:39:11,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:39:11,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:11,819 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-02-18 09:39:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:12,800 INFO L93 Difference]: Finished difference Result 117 states and 435 transitions. [2019-02-18 09:39:12,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:39:12,801 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-18 09:39:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:12,802 INFO L225 Difference]: With dead ends: 117 [2019-02-18 09:39:12,802 INFO L226 Difference]: Without dead ends: 115 [2019-02-18 09:39:12,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-02-18 09:39:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-18 09:39:12,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 74. [2019-02-18 09:39:12,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-18 09:39:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 344 transitions. [2019-02-18 09:39:12,834 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 344 transitions. Word has length 6 [2019-02-18 09:39:12,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:12,834 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 344 transitions. [2019-02-18 09:39:12,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:39:12,834 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 344 transitions. [2019-02-18 09:39:12,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:12,835 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:12,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:12,835 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:12,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:12,836 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-02-18 09:39:12,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:12,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:12,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:12,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:12,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:13,015 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:13,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:13,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:13,016 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:13,016 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-02-18 09:39:13,017 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:13,018 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:13,020 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:13,020 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:13,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:13,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:13,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:13,021 INFO 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:13,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:13,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:13,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:13,038 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:13,041 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:13,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:39:13,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,057 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:39:13,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:13,069 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:13,089 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:13,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:13,111 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:13,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:13,138 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:13,138 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-18 09:39:13,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,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, 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:13,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:13,205 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:13,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:39:13,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,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, 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:13,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:13,260 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:13,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:39:13,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:13,290 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:13,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 33 treesize of output 77 [2019-02-18 09:39:13,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:13,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:13,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:39:13,342 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:13,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:13,378 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:13,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:13,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:39:13,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:13,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:13,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:13,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:39:13,399 INFO L87 Difference]: Start difference. First operand 74 states and 344 transitions. Second operand 10 states. [2019-02-18 09:39:13,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:13,854 INFO L93 Difference]: Finished difference Result 99 states and 372 transitions. [2019-02-18 09:39:13,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:13,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:39:13,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:13,856 INFO L225 Difference]: With dead ends: 99 [2019-02-18 09:39:13,856 INFO L226 Difference]: Without dead ends: 98 [2019-02-18 09:39:13,856 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:13,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-18 09:39:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2019-02-18 09:39:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-18 09:39:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 338 transitions. [2019-02-18 09:39:13,878 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 338 transitions. Word has length 6 [2019-02-18 09:39:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:13,878 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 338 transitions. [2019-02-18 09:39:13,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 338 transitions. [2019-02-18 09:39:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:13,879 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:13,879 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-18 09:39:13,879 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:13,880 INFO L82 PathProgramCache]: Analyzing trace with hash 904323436, now seen corresponding path program 3 times [2019-02-18 09:39:13,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:13,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:13,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:13,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:13,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:14,008 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:14,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:14,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:14,008 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:14,008 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:14,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:14,008 INFO 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:14,018 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:39:14,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:39:14,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:39:14,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:14,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:14,030 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:14,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,032 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:14,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,044 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:14,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:14,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:14,064 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:14,093 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,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:14,120 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,130 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,150 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,150 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:14,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,192 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:14,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:14,235 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,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:14,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,273 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 L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,277 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:39:14,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:14,329 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,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:14,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-18 09:39:14,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:14,442 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:14,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-02-18 09:39:14,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:14,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, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 110 [2019-02-18 09:39:14,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:14,540 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:14,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:14,567 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:14,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:14,620 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:39:14,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:14,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:39:14,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:14,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:39:14,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:39:14,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:39:14,640 INFO L87 Difference]: Start difference. First operand 73 states and 338 transitions. Second operand 11 states. [2019-02-18 09:39:15,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:15,363 INFO L93 Difference]: Finished difference Result 132 states and 470 transitions. [2019-02-18 09:39:15,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:15,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-18 09:39:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:15,365 INFO L225 Difference]: With dead ends: 132 [2019-02-18 09:39:15,365 INFO L226 Difference]: Without dead ends: 130 [2019-02-18 09:39:15,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:39:15,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-18 09:39:15,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 74. [2019-02-18 09:39:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-18 09:39:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 334 transitions. [2019-02-18 09:39:15,406 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 334 transitions. Word has length 6 [2019-02-18 09:39:15,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:15,406 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 334 transitions. [2019-02-18 09:39:15,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:39:15,406 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 334 transitions. [2019-02-18 09:39:15,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:15,407 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:15,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:15,407 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:15,409 INFO L82 PathProgramCache]: Analyzing trace with hash 904329702, now seen corresponding path program 1 times [2019-02-18 09:39:15,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:15,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:15,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:39:15,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:15,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:15,780 WARN L181 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-18 09:39:15,805 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,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:15,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:15,806 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:15,806 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-02-18 09:39:15,808 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:15,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:15,810 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:15,811 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:15,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:15,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:15,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:15,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:15,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:15,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:15,866 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:15,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,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, 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:15,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,889 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:15,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:15,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:15,906 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:15,906 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:15,933 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,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:15,960 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,970 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,989 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,989 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:16,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:16,065 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,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:16,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,102 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:39:16,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:16,149 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,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:16,171 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:16,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:16,193 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:16,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:16,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:16,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:16,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:16,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:16,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:16,211 INFO L87 Difference]: Start difference. First operand 74 states and 334 transitions. Second operand 8 states. [2019-02-18 09:39:16,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:16,557 INFO L93 Difference]: Finished difference Result 87 states and 350 transitions. [2019-02-18 09:39:16,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:39:16,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:39:16,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:16,559 INFO L225 Difference]: With dead ends: 87 [2019-02-18 09:39:16,559 INFO L226 Difference]: Without dead ends: 86 [2019-02-18 09:39:16,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-18 09:39:16,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2019-02-18 09:39:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-18 09:39:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 337 transitions. [2019-02-18 09:39:16,592 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 337 transitions. Word has length 6 [2019-02-18 09:39:16,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:16,593 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 337 transitions. [2019-02-18 09:39:16,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 337 transitions. [2019-02-18 09:39:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:16,593 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:16,594 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:16,594 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:16,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:16,594 INFO L82 PathProgramCache]: Analyzing trace with hash 904316184, now seen corresponding path program 1 times [2019-02-18 09:39:16,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:16,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:16,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:16,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:16,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:16,723 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,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:16,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:16,724 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:16,724 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [25] [2019-02-18 09:39:16,725 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:16,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:16,728 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:16,728 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:16,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:16,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:16,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:16,728 INFO 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:16,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:16,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:16,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:16,746 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:16,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:16,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,769 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:16,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,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, 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:16,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,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, 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,806 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:16,833 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:16,848 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,860 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,871 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,890 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,890 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:16,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:39:16,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:16,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:16,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:16,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:16,999 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:39:16,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:17,047 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:17,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:17,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,081 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:17,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:17,083 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:39:17,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:17,132 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:17,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:39:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:17,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:17,176 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:17,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:17,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:39:17,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:17,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:17,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:17,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:17,196 INFO L87 Difference]: Start difference. First operand 73 states and 337 transitions. Second operand 10 states. [2019-02-18 09:39:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:17,684 INFO L93 Difference]: Finished difference Result 106 states and 387 transitions. [2019-02-18 09:39:17,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:17,684 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:39:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:17,685 INFO L225 Difference]: With dead ends: 106 [2019-02-18 09:39:17,686 INFO L226 Difference]: Without dead ends: 105 [2019-02-18 09:39:17,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:39:17,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-18 09:39:17,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2019-02-18 09:39:17,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-18 09:39:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 349 transitions. [2019-02-18 09:39:17,726 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 349 transitions. Word has length 6 [2019-02-18 09:39:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:17,727 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 349 transitions. [2019-02-18 09:39:17,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 349 transitions. [2019-02-18 09:39:17,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:17,727 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:17,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:17,728 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:17,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:17,728 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-02-18 09:39:17,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:17,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:17,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:17,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:17,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:17,908 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-18 09:39:17,968 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:17,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:17,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:17,969 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:17,969 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-02-18 09:39:17,971 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:17,972 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:17,974 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:17,974 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:17,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:17,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:17,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:17,975 INFO 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:17,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:17,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:18,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:18,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, 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:18,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,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, 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:18,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,051 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:18,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,112 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:18,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:18,121 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:18,149 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:18,164 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,176 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,186 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,205 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,206 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:18,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,243 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:18,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:18,285 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,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [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,310 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,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,323 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:39:18,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:18,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:18,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:18,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:18,410 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:18,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-02-18 09:39:18,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:18,466 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:18,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:18,489 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,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:18,530 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,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:18,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:39:18,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:18,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:18,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:18,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:39:18,550 INFO L87 Difference]: Start difference. First operand 75 states and 349 transitions. Second operand 10 states. [2019-02-18 09:39:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:19,072 INFO L93 Difference]: Finished difference Result 102 states and 394 transitions. [2019-02-18 09:39:19,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:19,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:39:19,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:19,074 INFO L225 Difference]: With dead ends: 102 [2019-02-18 09:39:19,074 INFO L226 Difference]: Without dead ends: 101 [2019-02-18 09:39:19,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-18 09:39:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2019-02-18 09:39:19,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-18 09:39:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-02-18 09:39:19,105 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-02-18 09:39:19,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:19,105 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-02-18 09:39:19,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:19,105 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-02-18 09:39:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:19,105 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:19,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:19,105 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:19,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:19,106 INFO L82 PathProgramCache]: Analyzing trace with hash 904448866, now seen corresponding path program 1 times [2019-02-18 09:39:19,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:19,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:19,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:19,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:19,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:19,195 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:19,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:19,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:19,195 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:19,195 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-02-18 09:39:19,197 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:19,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:19,199 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:19,199 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:19,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:19,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:19,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:19,200 INFO 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:19,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:19,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:19,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:19,225 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:19,233 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:19,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:39:19,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,252 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:39:19,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,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, 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,263 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:19,281 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,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:19,303 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,313 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,329 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,330 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:39:19,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:19,511 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,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:39:19,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:19,533 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:19,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:39:19,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:19,563 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,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-18 09:39:19,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:19,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:19,606 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:19,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:19,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:19,625 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:19,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:19,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:19,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:19,625 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 8 states. [2019-02-18 09:39:19,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:19,902 INFO L93 Difference]: Finished difference Result 94 states and 387 transitions. [2019-02-18 09:39:19,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:39:19,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:39:19,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:19,904 INFO L225 Difference]: With dead ends: 94 [2019-02-18 09:39:19,904 INFO L226 Difference]: Without dead ends: 93 [2019-02-18 09:39:19,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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:39:19,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-18 09:39:19,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2019-02-18 09:39:19,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-18 09:39:19,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-02-18 09:39:19,936 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-02-18 09:39:19,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:19,936 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-02-18 09:39:19,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-02-18 09:39:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:19,936 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:19,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:19,937 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:19,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:19,937 INFO L82 PathProgramCache]: Analyzing trace with hash 904439192, now seen corresponding path program 1 times [2019-02-18 09:39:19,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:19,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:19,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:19,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:19,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:20,480 WARN L181 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-18 09:39:20,555 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:20,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:20,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:20,555 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:20,555 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [25] [2019-02-18 09:39:20,556 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:20,556 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:20,558 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:20,558 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:20,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:20,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:20,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:20,559 INFO 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:20,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:20,573 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:20,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:20,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, 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,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:39:20,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,687 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:39:20,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:20,698 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,718 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,731 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,743 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,754 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,772 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,772 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:39:20,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:20,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,850 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,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:39:20,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,881 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:20,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:39:20,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,913 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,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-02-18 09:39:20,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,946 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 69 [2019-02-18 09:39:20,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,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:20,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:39:20,994 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:20,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:21,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:21,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:39:21,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:21,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:21,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:21,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:39:21,045 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 10 states. [2019-02-18 09:39:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:21,436 INFO L93 Difference]: Finished difference Result 116 states and 427 transitions. [2019-02-18 09:39:21,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:39:21,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:39:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:21,438 INFO L225 Difference]: With dead ends: 116 [2019-02-18 09:39:21,439 INFO L226 Difference]: Without dead ends: 115 [2019-02-18 09:39:21,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:39:21,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-18 09:39:21,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2019-02-18 09:39:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-18 09:39:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 373 transitions. [2019-02-18 09:39:21,469 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 373 transitions. Word has length 6 [2019-02-18 09:39:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:21,469 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 373 transitions. [2019-02-18 09:39:21,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 373 transitions. [2019-02-18 09:39:21,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:21,470 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:21,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:21,470 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:21,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:21,470 INFO L82 PathProgramCache]: Analyzing trace with hash 904550232, now seen corresponding path program 1 times [2019-02-18 09:39:21,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:21,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:21,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:21,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:21,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:21,684 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-02-18 09:39:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:21,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:21,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:21,760 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:21,760 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [23] [2019-02-18 09:39:21,761 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:21,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:21,763 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:21,764 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:39:21,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:21,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:21,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:21,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:21,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:21,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:21,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:21,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:21,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,797 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:21,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:21,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:39:21,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,829 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:21,830 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:21,856 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,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:21,883 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,894 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,912 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:21,913 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:21,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,984 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:21,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,024 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:22,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:22,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,062 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:39:22,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,109 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:22,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:22,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,162 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:22,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-02-18 09:39:22,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,214 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:22,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:22,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,314 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:22,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,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, 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:39:22,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,363 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:22,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:39:22,389 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:22,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:22,444 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:39:22,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:22,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:39:22,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:22,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:39:22,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:39:22,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:22,464 INFO L87 Difference]: Start difference. First operand 79 states and 373 transitions. Second operand 12 states. [2019-02-18 09:39:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:23,467 INFO L93 Difference]: Finished difference Result 140 states and 516 transitions. [2019-02-18 09:39:23,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:23,467 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-18 09:39:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:23,469 INFO L225 Difference]: With dead ends: 140 [2019-02-18 09:39:23,469 INFO L226 Difference]: Without dead ends: 139 [2019-02-18 09:39:23,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:39:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-18 09:39:23,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2019-02-18 09:39:23,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-18 09:39:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 355 transitions. [2019-02-18 09:39:23,516 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 355 transitions. Word has length 6 [2019-02-18 09:39:23,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:23,516 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 355 transitions. [2019-02-18 09:39:23,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:39:23,516 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 355 transitions. [2019-02-18 09:39:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:23,517 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:23,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:23,517 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:23,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:23,517 INFO L82 PathProgramCache]: Analyzing trace with hash 904568030, now seen corresponding path program 1 times [2019-02-18 09:39:23,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:23,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:23,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:23,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:23,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:23,574 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:23,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:23,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:23,574 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:23,574 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-02-18 09:39:23,576 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:23,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:23,578 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:23,578 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:23,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:23,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:23,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:23,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:23,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:23,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:23,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:23,594 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:23,601 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:23,605 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:23,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:23,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-18 09:39:23,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:23,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:23,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-18 09:39:23,638 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:23,652 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:23,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:23,672 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:23,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:23,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:39:23,696 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-02-18 09:39:23,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:23,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:23,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:23,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:23,726 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:23,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:23,748 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:23,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:39:23,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:23,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:23,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:23,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:23,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:23,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:23,764 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:23,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:23,785 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:23,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-18 09:39:23,797 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:23,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:23,810 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:23,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:23,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:39:23,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:23,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:23,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:23,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:39:23,829 INFO L87 Difference]: Start difference. First operand 76 states and 355 transitions. Second operand 8 states. [2019-02-18 09:39:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:24,096 INFO L93 Difference]: Finished difference Result 112 states and 470 transitions. [2019-02-18 09:39:24,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:24,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:39:24,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:24,098 INFO L225 Difference]: With dead ends: 112 [2019-02-18 09:39:24,098 INFO L226 Difference]: Without dead ends: 111 [2019-02-18 09:39:24,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:24,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-18 09:39:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2019-02-18 09:39:24,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-18 09:39:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 380 transitions. [2019-02-18 09:39:24,147 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 380 transitions. Word has length 6 [2019-02-18 09:39:24,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:24,147 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 380 transitions. [2019-02-18 09:39:24,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:24,147 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 380 transitions. [2019-02-18 09:39:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:24,148 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:24,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:24,148 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:24,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:24,148 INFO L82 PathProgramCache]: Analyzing trace with hash 906170478, now seen corresponding path program 2 times [2019-02-18 09:39:24,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:24,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:24,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:24,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:24,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:24,308 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:24,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:24,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:24,309 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:24,309 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:24,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:24,309 INFO 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:24,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:39:24,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:39:24,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:39:24,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:24,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:24,343 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:24,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,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, 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,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,352 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,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,359 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,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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,369 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:24,397 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,410 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,422 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,432 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,450 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:24,451 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:24,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,492 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,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:24,530 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,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:24,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,571 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:24,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:24,616 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,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:24,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,655 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:39:24,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:24,698 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,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:24,730 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 L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,803 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:24,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:24,804 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:39:24,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:24,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:39:24,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:39:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:24,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:24,937 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:39:24,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:24,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:39:24,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:24,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:39:24,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:39:24,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:24,957 INFO L87 Difference]: Start difference. First operand 80 states and 380 transitions. Second operand 12 states. [2019-02-18 09:39:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:25,866 INFO L93 Difference]: Finished difference Result 137 states and 479 transitions. [2019-02-18 09:39:25,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:25,866 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-18 09:39:25,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:25,868 INFO L225 Difference]: With dead ends: 137 [2019-02-18 09:39:25,868 INFO L226 Difference]: Without dead ends: 135 [2019-02-18 09:39:25,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:39:25,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-18 09:39:25,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 77. [2019-02-18 09:39:25,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-18 09:39:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 361 transitions. [2019-02-18 09:39:25,906 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 361 transitions. Word has length 6 [2019-02-18 09:39:25,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:25,907 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 361 transitions. [2019-02-18 09:39:25,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:39:25,907 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 361 transitions. [2019-02-18 09:39:25,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:25,907 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:25,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:25,908 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:25,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:25,908 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-02-18 09:39:25,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:25,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:25,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:39:25,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:25,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:26,041 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:26,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:26,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:26,041 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:26,042 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-02-18 09:39:26,042 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:26,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:26,045 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:26,045 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:26,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:26,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:26,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:26,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:26,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:26,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:26,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:26,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:26,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:26,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:26,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:39:26,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:26,090 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:26,118 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,133 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,144 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,155 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,173 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:26,174 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [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,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:26,248 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,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:26,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,284 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:26,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 09:39:26,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:26,331 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,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:26,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:26,447 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,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:26,500 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,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:26,521 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,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:26,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:26,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:26,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:39:26,572 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:26,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:26,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:26,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:26,573 INFO L87 Difference]: Start difference. First operand 77 states and 361 transitions. Second operand 10 states. [2019-02-18 09:39:27,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:27,061 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-02-18 09:39:27,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:27,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:39:27,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:27,063 INFO L225 Difference]: With dead ends: 124 [2019-02-18 09:39:27,063 INFO L226 Difference]: Without dead ends: 123 [2019-02-18 09:39:27,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:39:27,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-18 09:39:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2019-02-18 09:39:27,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-18 09:39:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 403 transitions. [2019-02-18 09:39:27,103 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 403 transitions. Word has length 6 [2019-02-18 09:39:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:27,104 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 403 transitions. [2019-02-18 09:39:27,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 403 transitions. [2019-02-18 09:39:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:27,104 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:27,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:27,105 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:27,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:27,105 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-02-18 09:39:27,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:27,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:27,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:27,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:27,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:27,242 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:27,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:27,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:27,243 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:27,243 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-02-18 09:39:27,245 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:27,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:27,247 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:27,247 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:27,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:27,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:27,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:27,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:27,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:27,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:27,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:27,267 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:27,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:27,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:27,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,287 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:27,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,295 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:27,295 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:27,322 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:27,337 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,349 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,359 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,378 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:27,379 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:27,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,411 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:27,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:27,455 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:27,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:27,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,489 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:27,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:27,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:27,531 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,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:27,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:27,567 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:27,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:27,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:27,612 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:27,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:27,633 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:27,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:27,670 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:27,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:27,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 09:39:27,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:27,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:39:27,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:39:27,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:27,689 INFO L87 Difference]: Start difference. First operand 84 states and 403 transitions. Second operand 9 states. [2019-02-18 09:39:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:28,285 INFO L93 Difference]: Finished difference Result 119 states and 475 transitions. [2019-02-18 09:39:28,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:28,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-18 09:39:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:28,287 INFO L225 Difference]: With dead ends: 119 [2019-02-18 09:39:28,287 INFO L226 Difference]: Without dead ends: 118 [2019-02-18 09:39:28,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:39:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-02-18 09:39:28,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2019-02-18 09:39:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-18 09:39:28,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 445 transitions. [2019-02-18 09:39:28,335 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 445 transitions. Word has length 6 [2019-02-18 09:39:28,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:28,335 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 445 transitions. [2019-02-18 09:39:28,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:39:28,335 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 445 transitions. [2019-02-18 09:39:28,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:28,336 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:28,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:28,336 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:28,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:28,337 INFO L82 PathProgramCache]: Analyzing trace with hash 906285674, now seen corresponding path program 1 times [2019-02-18 09:39:28,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:28,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:28,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:28,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:28,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:28,491 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:28,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:28,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:28,492 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:28,492 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [23] [2019-02-18 09:39:28,493 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:28,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:28,494 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:28,494 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:39:28,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:28,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:28,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:28,495 INFO 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:39:28,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:28,503 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:28,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:28,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:28,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,520 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:28,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:28,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,531 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:28,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,538 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:28,539 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:28,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:28,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:28,591 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,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:28,620 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:28,620 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:28,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:28,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:28,695 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:28,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:28,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,733 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:28,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:28,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:39:28,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:28,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,818 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:28,819 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:28,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:28,867 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:28,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:28,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,913 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 L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:28,925 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:28,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-18 09:39:28,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:28,974 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:28,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:28,992 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:28,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:29,044 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:39:29,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:29,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:39:29,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:29,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:39:29,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:39:29,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:39:29,063 INFO L87 Difference]: Start difference. First operand 91 states and 445 transitions. Second operand 12 states. [2019-02-18 09:39:30,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:30,076 INFO L93 Difference]: Finished difference Result 149 states and 594 transitions. [2019-02-18 09:39:30,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:30,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-18 09:39:30,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:30,078 INFO L225 Difference]: With dead ends: 149 [2019-02-18 09:39:30,078 INFO L226 Difference]: Without dead ends: 148 [2019-02-18 09:39:30,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=209, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:39:30,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-02-18 09:39:30,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2019-02-18 09:39:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-18 09:39:30,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 487 transitions. [2019-02-18 09:39:30,130 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 487 transitions. Word has length 6 [2019-02-18 09:39:30,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:30,130 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 487 transitions. [2019-02-18 09:39:30,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:39:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 487 transitions. [2019-02-18 09:39:30,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:30,131 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:30,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:30,131 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:30,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:30,132 INFO L82 PathProgramCache]: Analyzing trace with hash 906286234, now seen corresponding path program 1 times [2019-02-18 09:39:30,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:30,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:30,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:30,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:30,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:30,243 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:30,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:30,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:30,244 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:30,244 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-02-18 09:39:30,244 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:30,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:30,246 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:30,247 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:30,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:30,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:30,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:30,247 INFO 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:39:30,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:30,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:30,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:30,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 18 treesize of output 21 [2019-02-18 09:39:30,269 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:30,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:39:30,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,293 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:39:30,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:39:30,304 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:30,324 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:30,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:30,346 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:30,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:30,372 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:30,373 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:39:30,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:30,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:30,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:30,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:39:30,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:30,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:30,503 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:30,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:39:30,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:30,536 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:30,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 09:39:30,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:30,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:30,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:39:30,588 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:30,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:30,622 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:30,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:30,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:39:30,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:30,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:30,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:30,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:39:30,641 INFO L87 Difference]: Start difference. First operand 98 states and 487 transitions. Second operand 10 states. [2019-02-18 09:39:31,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:31,157 INFO L93 Difference]: Finished difference Result 139 states and 554 transitions. [2019-02-18 09:39:31,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:39:31,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:39:31,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:31,159 INFO L225 Difference]: With dead ends: 139 [2019-02-18 09:39:31,159 INFO L226 Difference]: Without dead ends: 138 [2019-02-18 09:39:31,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:39:31,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-18 09:39:31,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2019-02-18 09:39:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-18 09:39:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 505 transitions. [2019-02-18 09:39:31,212 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 505 transitions. Word has length 6 [2019-02-18 09:39:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:31,212 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 505 transitions. [2019-02-18 09:39:31,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:31,212 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 505 transitions. [2019-02-18 09:39:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:31,213 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:31,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:31,213 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:31,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:31,213 INFO L82 PathProgramCache]: Analyzing trace with hash 906397274, now seen corresponding path program 2 times [2019-02-18 09:39:31,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:31,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:31,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:31,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:31,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:31,347 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-18 09:39:31,426 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:31,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:31,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:31,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:31,427 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:31,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:31,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:31,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:39:31,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:39:31,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:39:31,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:31,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:31,452 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:31,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,455 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:31,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,459 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, 2 select indices, 2 select 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:31,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:31,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:31,476 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:31,502 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,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:31,530 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,540 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,559 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,559 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:31,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,598 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:31,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:31,641 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,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:31,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,681 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:31,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:31,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:31,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:31,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:31,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,765 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:31,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 09:39:31,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:31,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:31,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:31,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:31,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:31,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:31,906 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:31,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:31,932 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:31,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:32,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:32,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:39:32,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:32,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:39:32,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:39:32,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:32,007 INFO L87 Difference]: Start difference. First operand 101 states and 505 transitions. Second operand 12 states. [2019-02-18 09:39:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:32,822 INFO L93 Difference]: Finished difference Result 164 states and 623 transitions. [2019-02-18 09:39:32,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:32,822 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-18 09:39:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:32,824 INFO L225 Difference]: With dead ends: 164 [2019-02-18 09:39:32,824 INFO L226 Difference]: Without dead ends: 163 [2019-02-18 09:39:32,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:39:32,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-18 09:39:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 100. [2019-02-18 09:39:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-18 09:39:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 499 transitions. [2019-02-18 09:39:32,878 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 499 transitions. Word has length 6 [2019-02-18 09:39:32,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:32,879 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 499 transitions. [2019-02-18 09:39:32,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:39:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 499 transitions. [2019-02-18 09:39:32,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:32,879 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:32,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:32,879 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:32,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:32,880 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-02-18 09:39:32,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:32,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:32,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:39:32,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:32,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:33,021 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:33,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:33,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:33,021 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:33,022 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [27] [2019-02-18 09:39:33,022 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:33,022 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:33,025 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:33,025 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:33,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:33,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:33,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:33,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:33,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:33,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:33,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:33,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:33,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:33,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,063 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: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,072 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: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,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:33,084 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:33,118 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:33,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:33,150 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:33,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:33,184 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,185 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:33,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,230 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:33,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:33,271 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,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:33,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:33,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 09:39:33,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:33,354 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:33,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:33,377 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:33,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:33,399 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:33,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:33,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:33,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:33,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:33,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:33,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:33,419 INFO L87 Difference]: Start difference. First operand 100 states and 499 transitions. Second operand 8 states. [2019-02-18 09:39:33,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:33,787 INFO L93 Difference]: Finished difference Result 122 states and 529 transitions. [2019-02-18 09:39:33,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:39:33,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:39:33,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:33,790 INFO L225 Difference]: With dead ends: 122 [2019-02-18 09:39:33,790 INFO L226 Difference]: Without dead ends: 121 [2019-02-18 09:39:33,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 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:33,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-18 09:39:33,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2019-02-18 09:39:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-18 09:39:33,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 511 transitions. [2019-02-18 09:39:33,856 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 511 transitions. Word has length 6 [2019-02-18 09:39:33,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:33,856 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 511 transitions. [2019-02-18 09:39:33,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 511 transitions. [2019-02-18 09:39:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:33,857 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:33,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:33,857 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:33,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:33,857 INFO L82 PathProgramCache]: Analyzing trace with hash 893472260, now seen corresponding path program 1 times [2019-02-18 09:39:33,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:33,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:33,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:33,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:33,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:34,003 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-18 09:39:34,049 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,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:34,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:34,049 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:34,050 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [25] [2019-02-18 09:39:34,050 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:34,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:34,053 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:34,053 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:34,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:34,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:34,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:34,054 INFO 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:39:34,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:34,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:34,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:34,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:34,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,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, 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:34,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,085 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:34,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,093 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,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,099 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:34,100 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:34,128 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,143 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:34,155 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,165 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,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:39:34,182 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:34,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:34,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:34,261 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:34,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:34,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,298 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:34,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 80 [2019-02-18 09:39:34,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:34,345 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:34,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:34,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:34,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:34,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:34,432 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:34,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:34,454 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:34,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:34,487 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:34,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:34,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:39:34,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:34,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:34,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:34,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:34,507 INFO L87 Difference]: Start difference. First operand 102 states and 511 transitions. Second operand 10 states. [2019-02-18 09:39:35,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:35,059 INFO L93 Difference]: Finished difference Result 154 states and 624 transitions. [2019-02-18 09:39:35,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:35,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:39:35,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:35,062 INFO L225 Difference]: With dead ends: 154 [2019-02-18 09:39:35,062 INFO L226 Difference]: Without dead ends: 153 [2019-02-18 09:39:35,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:39:35,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-02-18 09:39:35,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2019-02-18 09:39:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-18 09:39:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-02-18 09:39:35,123 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-02-18 09:39:35,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:35,123 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-02-18 09:39:35,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-02-18 09:39:35,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:35,124 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:35,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:35,125 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:35,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:35,125 INFO L82 PathProgramCache]: Analyzing trace with hash 897358608, now seen corresponding path program 1 times [2019-02-18 09:39:35,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:35,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:35,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:35,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:35,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:35,231 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:35,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:35,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:35,232 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:35,232 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-02-18 09:39:35,233 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:35,233 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:35,236 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:35,236 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:35,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:35,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:35,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:35,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:35,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:35,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:35,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:35,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 18 treesize of output 21 [2019-02-18 09:39:35,258 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:35,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:39:35,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:39:35,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,280 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:35,281 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:35,301 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:35,312 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:35,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:35,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:35,349 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:35,349 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:39:35,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:35,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:35,419 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:35,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:39:35,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:35,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 09:39:35,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:35,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:35,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:39:35,498 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:35,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:35,519 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:35,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:35,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:35,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:35,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:35,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:35,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:35,540 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 8 states. [2019-02-18 09:39:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:35,864 INFO L93 Difference]: Finished difference Result 130 states and 583 transitions. [2019-02-18 09:39:35,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:39:35,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:39:35,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:35,867 INFO L225 Difference]: With dead ends: 130 [2019-02-18 09:39:35,867 INFO L226 Difference]: Without dead ends: 129 [2019-02-18 09:39:35,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:35,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-18 09:39:35,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2019-02-18 09:39:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-18 09:39:35,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-02-18 09:39:35,941 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-02-18 09:39:35,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:35,942 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-02-18 09:39:35,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:35,942 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-02-18 09:39:35,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:35,942 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:35,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:35,943 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:35,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:35,943 INFO L82 PathProgramCache]: Analyzing trace with hash 896931860, now seen corresponding path program 2 times [2019-02-18 09:39:35,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:35,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:35,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:35,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:35,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:36,111 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:36,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:36,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:36,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:36,112 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:36,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:36,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:36,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:39:36,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:39:36,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:39:36,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:36,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:36,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:36,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:36,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,144 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:36,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,150 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:36,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:36,160 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:36,188 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:36,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:36,216 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:36,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:36,244 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:36,245 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:36,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,280 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:36,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:36,333 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:36,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:36,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:39:36,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:36,441 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:36,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:36,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:36,481 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:36,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-18 09:39:36,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:36,532 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:36,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:36,553 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:36,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:36,584 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:36,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:36,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 09:39:36,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:36,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:39:36,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:39:36,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:36,604 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 9 states. [2019-02-18 09:39:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:37,132 INFO L93 Difference]: Finished difference Result 160 states and 682 transitions. [2019-02-18 09:39:37,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:39:37,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-18 09:39:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:37,135 INFO L225 Difference]: With dead ends: 160 [2019-02-18 09:39:37,135 INFO L226 Difference]: Without dead ends: 159 [2019-02-18 09:39:37,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:39:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-18 09:39:37,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2019-02-18 09:39:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-18 09:39:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 603 transitions. [2019-02-18 09:39:37,202 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 603 transitions. Word has length 6 [2019-02-18 09:39:37,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:37,202 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 603 transitions. [2019-02-18 09:39:37,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:39:37,202 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 603 transitions. [2019-02-18 09:39:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:37,202 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:37,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:37,203 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:37,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:37,203 INFO L82 PathProgramCache]: Analyzing trace with hash 897479758, now seen corresponding path program 1 times [2019-02-18 09:39:37,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:37,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:37,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:39:37,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:37,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:37,357 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-18 09:39:37,364 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:37,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:37,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:37,364 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:37,364 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [28], [29] [2019-02-18 09:39:37,367 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:37,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:37,369 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:37,370 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:39:37,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:37,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:37,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:37,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:37,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:37,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:37,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:37,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:39:37,393 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:37,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:39:37,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:39:37,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:37,416 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:37,435 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:37,447 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,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:37,467 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,483 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,484 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-18 09:39:37,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:37,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:37,548 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,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:39:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:37,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:37,574 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:37,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:39:37,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-18 09:39:37,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:39:37,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:39:37,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:39:37,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:39:37,594 INFO L87 Difference]: Start difference. First operand 117 states and 603 transitions. Second operand 4 states. [2019-02-18 09:39:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:37,690 INFO L93 Difference]: Finished difference Result 121 states and 607 transitions. [2019-02-18 09:39:37,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:39:37,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-18 09:39:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:37,692 INFO L225 Difference]: With dead ends: 121 [2019-02-18 09:39:37,692 INFO L226 Difference]: Without dead ends: 117 [2019-02-18 09:39:37,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:39:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-18 09:39:37,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-02-18 09:39:37,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-02-18 09:39:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 599 transitions. [2019-02-18 09:39:37,759 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 599 transitions. Word has length 6 [2019-02-18 09:39:37,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:37,759 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 599 transitions. [2019-02-18 09:39:37,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:39:37,759 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 599 transitions. [2019-02-18 09:39:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:37,759 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:37,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:37,760 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:37,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:37,760 INFO L82 PathProgramCache]: Analyzing trace with hash 897162312, now seen corresponding path program 2 times [2019-02-18 09:39:37,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:37,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:37,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:37,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:37,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:37,899 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:37,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:37,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:37,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:37,900 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:37,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:37,900 INFO 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:39:37,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:39:37,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:39:37,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:39:37,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:37,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:37,918 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:37,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:37,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,935 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:37,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,944 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:37,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:37,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, 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:37,952 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:37,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:37,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:38,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:38,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:38,041 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:38,041 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:38,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,097 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:38,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:38,150 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:38,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:38,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,207 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:39:38,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:38,266 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:38,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:38,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,316 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:38,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-02-18 09:39:38,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:38,368 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:38,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:38,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:38,528 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:38,528 INFO L303 Elim1Store]: Index analysis took 137 ms [2019-02-18 09:39:38,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 99 [2019-02-18 09:39:38,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:38,682 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:38,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:38,706 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:38,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:38,765 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:39:38,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:38,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:39:38,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:38,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:39:38,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:39:38,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:38,785 INFO L87 Difference]: Start difference. First operand 114 states and 599 transitions. Second operand 12 states. [2019-02-18 09:39:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:39,701 INFO L93 Difference]: Finished difference Result 186 states and 791 transitions. [2019-02-18 09:39:39,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:39,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-18 09:39:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:39,704 INFO L225 Difference]: With dead ends: 186 [2019-02-18 09:39:39,704 INFO L226 Difference]: Without dead ends: 184 [2019-02-18 09:39:39,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:39:39,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-02-18 09:39:39,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 121. [2019-02-18 09:39:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-18 09:39:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 632 transitions. [2019-02-18 09:39:39,775 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 632 transitions. Word has length 6 [2019-02-18 09:39:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:39,775 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 632 transitions. [2019-02-18 09:39:39,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:39:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 632 transitions. [2019-02-18 09:39:39,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:39,776 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:39,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:39,776 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:39,776 INFO L82 PathProgramCache]: Analyzing trace with hash 897179862, now seen corresponding path program 1 times [2019-02-18 09:39:39,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:39,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:39,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:39:39,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:39,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:39,850 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:39,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:39,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:39,850 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:39:39,850 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [27] [2019-02-18 09:39:39,851 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:39,852 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:39,854 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:39,854 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:39,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:39,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:39,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:39,855 INFO 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:39:39,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:39,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:39,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:39,874 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,880 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,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:39:39,894 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,897 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:39:39,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,907 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:39,907 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:39,926 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,937 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,947 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,956 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,971 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,972 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-18 09:39:39,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:39,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:39:40,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:40,031 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,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:39:40,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:40,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:40,086 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,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:39:40,105 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:40,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:40,117 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:40,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:40,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:39:40,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:40,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:40,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:40,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:39:40,136 INFO L87 Difference]: Start difference. First operand 121 states and 632 transitions. Second operand 8 states. [2019-02-18 09:39:40,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:40,464 INFO L93 Difference]: Finished difference Result 161 states and 745 transitions. [2019-02-18 09:39:40,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:39:40,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:39:40,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:40,467 INFO L225 Difference]: With dead ends: 161 [2019-02-18 09:39:40,467 INFO L226 Difference]: Without dead ends: 160 [2019-02-18 09:39:40,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:39:40,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-02-18 09:39:40,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2019-02-18 09:39:40,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-18 09:39:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 714 transitions. [2019-02-18 09:39:40,544 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 714 transitions. Word has length 6 [2019-02-18 09:39:40,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:40,544 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 714 transitions. [2019-02-18 09:39:40,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:40,544 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 714 transitions. [2019-02-18 09:39:40,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:40,545 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:40,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:40,545 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:40,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:40,545 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 2 times [2019-02-18 09:39:40,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:40,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:40,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:40,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:40,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:40,648 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:40,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:40,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:40,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:40,648 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:40,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:40,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:40,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:39:40,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:39:40,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-18 09:39:40,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:40,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:40,666 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:40,670 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:40,674 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:40,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-18 09:39:40,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-18 09:39:40,697 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:40,711 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:40,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:40,730 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:40,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:40,753 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,753 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-02-18 09:39:40,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,781 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:40,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:40,797 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:40,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:39:40,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:40,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:40,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:40,835 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:40,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:39:40,850 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:40,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:40,867 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:40,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:40,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:40,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:40,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:40,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:40,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:40,887 INFO L87 Difference]: Start difference. First operand 133 states and 714 transitions. Second operand 8 states. [2019-02-18 09:39:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:41,222 INFO L93 Difference]: Finished difference Result 172 states and 801 transitions. [2019-02-18 09:39:41,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:41,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:39:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:41,224 INFO L225 Difference]: With dead ends: 172 [2019-02-18 09:39:41,224 INFO L226 Difference]: Without dead ends: 170 [2019-02-18 09:39:41,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-02-18 09:39:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2019-02-18 09:39:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-18 09:39:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 738 transitions. [2019-02-18 09:39:41,374 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 738 transitions. Word has length 6 [2019-02-18 09:39:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:41,374 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 738 transitions. [2019-02-18 09:39:41,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 738 transitions. [2019-02-18 09:39:41,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:41,376 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:41,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:41,377 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:41,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:41,377 INFO L82 PathProgramCache]: Analyzing trace with hash 900629352, now seen corresponding path program 3 times [2019-02-18 09:39:41,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:41,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:41,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:39:41,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:41,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:41,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:41,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:41,578 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:41,578 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:41,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:41,578 INFO 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:39:41,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:39:41,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:39:41,593 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:39:41,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:41,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:41,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:41,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,599 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:41,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,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:41,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,608 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:41,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,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, 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:41,616 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:41,643 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:41,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:41,668 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:41,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:41,695 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:41,696 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:41,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,737 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:41,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:41,778 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:41,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:41,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,816 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:41,817 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:41,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:41,859 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:41,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:41,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,898 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:39:41,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:41,940 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:41,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:41,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,977 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:41,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:41,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:39:41,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:42,026 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,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:39:42,055 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:42,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:42,112 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:39:42,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:42,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:39:42,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:42,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:39:42,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:39:42,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:42,132 INFO L87 Difference]: Start difference. First operand 137 states and 738 transitions. Second operand 12 states. [2019-02-18 09:39:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:42,901 INFO L93 Difference]: Finished difference Result 209 states and 906 transitions. [2019-02-18 09:39:42,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:42,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-18 09:39:42,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:42,903 INFO L225 Difference]: With dead ends: 209 [2019-02-18 09:39:42,904 INFO L226 Difference]: Without dead ends: 207 [2019-02-18 09:39:42,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:39:42,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-18 09:39:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 123. [2019-02-18 09:39:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-18 09:39:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 652 transitions. [2019-02-18 09:39:42,980 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 652 transitions. Word has length 6 [2019-02-18 09:39:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:42,980 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 652 transitions. [2019-02-18 09:39:42,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:39:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 652 transitions. [2019-02-18 09:39:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:39:42,981 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:42,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:39:42,981 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:42,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:42,982 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 2 times [2019-02-18 09:39:42,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:42,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:42,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:39:42,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:42,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:43,508 WARN L181 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-18 09:39:43,675 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-02-18 09:39:43,698 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:43,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:43,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:43,699 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:43,699 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:43,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:43,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:43,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:39:43,711 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:39:43,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:39:43,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:43,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:43,719 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:43,726 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:43,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:39:43,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:39:43,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:39:43,755 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:43,774 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:43,785 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:43,795 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:43,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:43,820 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:43,820 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:39:43,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,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, 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:43,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:43,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:43,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:39:43,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,906 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:43,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:43,934 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:43,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:39:43,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:43,994 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:43,994 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:43,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:44,032 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:44,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:39:44,047 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:44,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:44,101 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:44,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:44,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:39:44,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:44,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:44,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:44,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:44,120 INFO L87 Difference]: Start difference. First operand 123 states and 652 transitions. Second operand 10 states. [2019-02-18 09:39:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:44,617 INFO L93 Difference]: Finished difference Result 180 states and 787 transitions. [2019-02-18 09:39:44,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:44,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:39:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:44,620 INFO L225 Difference]: With dead ends: 180 [2019-02-18 09:39:44,620 INFO L226 Difference]: Without dead ends: 173 [2019-02-18 09:39:44,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:39:44,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-18 09:39:44,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 134. [2019-02-18 09:39:44,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-18 09:39:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 703 transitions. [2019-02-18 09:39:44,706 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 703 transitions. Word has length 6 [2019-02-18 09:39:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:44,707 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 703 transitions. [2019-02-18 09:39:44,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 703 transitions. [2019-02-18 09:39:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:39:44,707 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:44,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:44,707 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:44,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:44,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2018172698, now seen corresponding path program 1 times [2019-02-18 09:39:44,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:44,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:44,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:39:44,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:44,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:44,864 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:44,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:44,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:44,864 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:39:44,864 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-02-18 09:39:44,865 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:44,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:44,867 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:44,867 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:39:44,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:44,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:44,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:44,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 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:39:44,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:44,875 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:44,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:44,884 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:44,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:44,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:44,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:44,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:44,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:44,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:44,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:44,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:44,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, 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:44,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:44,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:44,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:44,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:44,921 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:44,922 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:44,948 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:44,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:44,974 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:44,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:45,001 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:45,001 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:45,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:39:45,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:45,075 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:45,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:45,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:45,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:45,154 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:45,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:45,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,197 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:45,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:45,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:45,247 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:45,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:45,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,285 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:45,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,287 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:39:45,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:45,332 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:45,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:39:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:45,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:45,540 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:39:45,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:45,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:39:45,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:45,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:39:45,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:39:45,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:39:45,558 INFO L87 Difference]: Start difference. First operand 134 states and 703 transitions. Second operand 12 states. [2019-02-18 09:39:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:46,370 INFO L93 Difference]: Finished difference Result 189 states and 804 transitions. [2019-02-18 09:39:46,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:39:46,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 09:39:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:46,373 INFO L225 Difference]: With dead ends: 189 [2019-02-18 09:39:46,373 INFO L226 Difference]: Without dead ends: 188 [2019-02-18 09:39:46,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:39:46,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-02-18 09:39:46,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 133. [2019-02-18 09:39:46,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-18 09:39:46,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 697 transitions. [2019-02-18 09:39:46,469 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 697 transitions. Word has length 7 [2019-02-18 09:39:46,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:46,469 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 697 transitions. [2019-02-18 09:39:46,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:39:46,469 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 697 transitions. [2019-02-18 09:39:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:39:46,470 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:46,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:46,470 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:46,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:46,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-02-18 09:39:46,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:46,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:46,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:46,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:46,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:46,648 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-02-18 09:39:46,747 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:46,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:46,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:46,748 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:39:46,748 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-02-18 09:39:46,749 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:46,749 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:46,751 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:46,751 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:39:46,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:46,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:46,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:46,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:46,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:46,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:46,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:46,767 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:46,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,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, 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:46,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:46,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:46,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:46,802 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:46,830 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:46,843 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:46,854 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:46,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:46,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:46,883 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:46,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:46,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:46,957 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:46,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:46,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,997 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:46,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:47,049 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,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:47,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,099 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:47,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:47,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:47,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:47,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:47,187 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:47,188 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,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:47,236 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,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:47,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:47,318 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,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:47,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:39:47,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:47,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:39:47,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:39:47,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:39:47,339 INFO L87 Difference]: Start difference. First operand 133 states and 697 transitions. Second operand 11 states. [2019-02-18 09:39:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:48,132 INFO L93 Difference]: Finished difference Result 169 states and 746 transitions. [2019-02-18 09:39:48,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:39:48,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-18 09:39:48,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:48,134 INFO L225 Difference]: With dead ends: 169 [2019-02-18 09:39:48,134 INFO L226 Difference]: Without dead ends: 168 [2019-02-18 09:39:48,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:39:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-02-18 09:39:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2019-02-18 09:39:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-18 09:39:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 691 transitions. [2019-02-18 09:39:48,228 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 691 transitions. Word has length 7 [2019-02-18 09:39:48,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:48,228 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 691 transitions. [2019-02-18 09:39:48,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:39:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 691 transitions. [2019-02-18 09:39:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:39:48,229 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:48,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:48,229 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:48,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:48,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-02-18 09:39:48,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:48,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:48,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:48,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:48,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:48,326 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:48,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:48,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:48,326 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:39:48,327 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-02-18 09:39:48,327 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:48,327 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:48,329 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:48,329 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:48,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:48,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:48,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:48,330 INFO 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:39:48,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:48,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:48,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:48,348 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:48,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:48,362 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:48,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:48,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:48,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-18 09:39:48,403 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:48,417 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:48,431 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:48,443 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:48,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:48,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:48,471 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-02-18 09:39:48,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:48,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:48,509 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:48,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:48,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:48,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-02-18 09:39:48,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:48,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:48,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:48,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:48,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:48,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:48,565 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:48,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-02-18 09:39:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:48,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:48,631 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:48,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:48,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:48,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:48,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:48,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:48,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:48,650 INFO L87 Difference]: Start difference. First operand 132 states and 691 transitions. Second operand 8 states. [2019-02-18 09:39:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:48,930 INFO L93 Difference]: Finished difference Result 159 states and 727 transitions. [2019-02-18 09:39:48,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:48,931 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-18 09:39:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:48,933 INFO L225 Difference]: With dead ends: 159 [2019-02-18 09:39:48,933 INFO L226 Difference]: Without dead ends: 158 [2019-02-18 09:39:48,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:39:48,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-02-18 09:39:49,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2019-02-18 09:39:49,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-18 09:39:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 706 transitions. [2019-02-18 09:39:49,024 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 706 transitions. Word has length 7 [2019-02-18 09:39:49,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:49,024 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 706 transitions. [2019-02-18 09:39:49,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 706 transitions. [2019-02-18 09:39:49,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:39:49,025 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:49,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:49,025 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:49,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:49,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2018050250, now seen corresponding path program 1 times [2019-02-18 09:39:49,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:49,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:49,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:49,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:49,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:49,390 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-02-18 09:39:49,499 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:39:49,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:49,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:49,500 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:39:49,500 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [23] [2019-02-18 09:39:49,501 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:49,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:49,503 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:49,503 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 09:39:49,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:49,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:49,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:49,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:49,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:49,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:49,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:49,528 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:49,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,533 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:49,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,539 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:49,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,547 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:49,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,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, 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:49,554 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:49,582 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:49,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:49,610 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:49,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:49,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:49,639 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:49,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:39:49,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:49,724 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:49,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:49,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:49,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:49,801 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:49,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:49,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,837 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:49,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,839 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:39:49,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:49,888 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:49,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-02-18 09:39:49,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:49,927 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:49,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-02-18 09:39:49,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:49,972 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:49,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:39:50,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:50,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:50,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:50,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:50,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:50,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:50,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:50,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:50,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:50,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:50,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:50,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:50,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:50,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:50,033 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:50,034 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:39:50,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:50,081 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:50,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:39:50,099 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:39:50,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:50,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:50,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-18 09:39:50,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:50,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:39:50,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:39:50,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:39:50,188 INFO L87 Difference]: Start difference. First operand 136 states and 706 transitions. Second operand 14 states. [2019-02-18 09:39:51,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:51,429 INFO L93 Difference]: Finished difference Result 199 states and 872 transitions. [2019-02-18 09:39:51,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:39:51,430 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-18 09:39:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:51,432 INFO L225 Difference]: With dead ends: 199 [2019-02-18 09:39:51,432 INFO L226 Difference]: Without dead ends: 198 [2019-02-18 09:39:51,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:39:51,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-02-18 09:39:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 134. [2019-02-18 09:39:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-18 09:39:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-02-18 09:39:51,523 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-02-18 09:39:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:51,523 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-02-18 09:39:51,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:39:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-02-18 09:39:51,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:39:51,523 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:51,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:51,523 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:51,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:51,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2018049690, now seen corresponding path program 1 times [2019-02-18 09:39:51,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:51,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:51,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:51,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:51,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:51,691 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-02-18 09:39:51,763 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:51,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:51,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:51,763 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:39:51,764 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [25] [2019-02-18 09:39:51,764 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:51,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:51,767 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:51,767 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:39:51,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:51,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:51,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:51,767 INFO 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:39:51,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:51,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:51,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:51,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:39:51,797 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:51,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:39:51,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:39:51,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,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, 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:51,822 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:51,845 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:51,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:51,865 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:51,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:51,891 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:51,891 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-18 09:39:51,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,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 45 [2019-02-18 09:39:51,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:51,961 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:51,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:39:51,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:51,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:51,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:52,021 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:52,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:39:52,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,051 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:52,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,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, 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:52,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:52,087 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:52,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-02-18 09:39:52,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:52,118 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:52,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:39:52,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:52,150 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:52,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:39:52,169 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:52,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:52,221 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:39:52,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:52,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:39:52,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:52,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:39:52,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:39:52,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:52,240 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 12 states. [2019-02-18 09:39:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:52,908 INFO L93 Difference]: Finished difference Result 181 states and 747 transitions. [2019-02-18 09:39:52,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:52,909 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 09:39:52,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:52,911 INFO L225 Difference]: With dead ends: 181 [2019-02-18 09:39:52,911 INFO L226 Difference]: Without dead ends: 180 [2019-02-18 09:39:52,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:39:52,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-02-18 09:39:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2019-02-18 09:39:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-18 09:39:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-02-18 09:39:53,009 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-02-18 09:39:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:53,009 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-02-18 09:39:53,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:39:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-02-18 09:39:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:39:53,010 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:53,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:53,010 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:53,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:53,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2017938650, now seen corresponding path program 2 times [2019-02-18 09:39:53,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:53,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:53,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:53,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:53,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:53,232 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:39:53,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:53,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:53,232 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:53,232 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:53,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:53,232 INFO 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:39:53,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:39:53,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:39:53,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-18 09:39:53,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:53,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:53,256 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:53,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:53,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,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, 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:53,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,277 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:53,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,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, 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:53,286 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:53,311 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:53,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:53,336 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:53,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:53,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:53,365 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:53,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,466 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:53,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:53,521 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:53,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:53,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:53,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:53,619 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:53,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:53,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,668 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:53,668 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:53,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:53,719 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:53,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:53,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,768 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:53,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:53,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:53,815 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:53,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:53,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,852 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:53,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:53,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:39:53,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:53,901 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:53,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:39:53,927 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:39:53,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:54,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:54,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-18 09:39:54,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:54,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:39:54,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:39:54,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=239, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:39:54,032 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 14 states. [2019-02-18 09:39:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:55,295 INFO L93 Difference]: Finished difference Result 200 states and 825 transitions. [2019-02-18 09:39:55,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:39:55,296 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-18 09:39:55,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:55,298 INFO L225 Difference]: With dead ends: 200 [2019-02-18 09:39:55,298 INFO L226 Difference]: Without dead ends: 199 [2019-02-18 09:39:55,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-02-18 09:39:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-02-18 09:39:55,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 131. [2019-02-18 09:39:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-02-18 09:39:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 674 transitions. [2019-02-18 09:39:55,401 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 674 transitions. Word has length 7 [2019-02-18 09:39:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:55,401 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 674 transitions. [2019-02-18 09:39:55,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:39:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 674 transitions. [2019-02-18 09:39:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:39:55,402 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:55,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:55,402 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:55,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:55,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2030969310, now seen corresponding path program 1 times [2019-02-18 09:39:55,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:55,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:55,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:39:55,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:55,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:55,550 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-18 09:39:55,618 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:55,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:55,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:55,618 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:39:55,619 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-02-18 09:39:55,619 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:55,620 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:55,622 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:55,622 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:55,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:55,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:55,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:55,623 INFO 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:39:55,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:55,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:55,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:55,638 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:55,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,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, 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:55,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,649 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:55,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,657 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:55,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:55,672 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:55,700 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:55,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:55,727 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:55,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:55,755 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:55,756 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:55,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,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, 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:55,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:55,832 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:55,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:55,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:39:55,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:55,922 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:55,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:55,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,958 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:55,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:55,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:39:55,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:56,006 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:56,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:39:56,029 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:56,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:56,063 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:56,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:56,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:39:56,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:56,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:56,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:56,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:39:56,082 INFO L87 Difference]: Start difference. First operand 131 states and 674 transitions. Second operand 10 states. [2019-02-18 09:39:56,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:56,612 INFO L93 Difference]: Finished difference Result 160 states and 731 transitions. [2019-02-18 09:39:56,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:56,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:39:56,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:56,614 INFO L225 Difference]: With dead ends: 160 [2019-02-18 09:39:56,614 INFO L226 Difference]: Without dead ends: 159 [2019-02-18 09:39:56,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:56,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-18 09:39:56,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2019-02-18 09:39:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-18 09:39:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 710 transitions. [2019-02-18 09:39:56,715 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 710 transitions. Word has length 7 [2019-02-18 09:39:56,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:56,716 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 710 transitions. [2019-02-18 09:39:56,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:56,716 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 710 transitions. [2019-02-18 09:39:56,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:39:56,716 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:56,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:56,717 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:56,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:56,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2030863664, now seen corresponding path program 1 times [2019-02-18 09:39:56,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:56,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:56,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:56,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:56,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:56,856 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:56,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:56,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:56,857 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:39:56,857 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-02-18 09:39:56,858 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:56,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:56,860 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:56,860 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:39:56,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:56,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:56,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:56,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:56,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:56,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:56,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:56,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:39:56,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:56,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:56,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:56,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:56,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:56,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:56,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:56,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:56,904 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:56,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:56,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:56,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:56,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:56,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, 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:56,912 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:56,947 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:56,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:56,973 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:56,983 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,001 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,001 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:57,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,034 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:57,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:57,075 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,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:57,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:39:57,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:57,163 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,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:57,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,205 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:57,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-02-18 09:39:57,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:57,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:57,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:39:57,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,288 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 L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,295 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:57,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:57,297 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:39:57,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:57,346 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:57,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:39:57,369 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:57,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:57,423 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:39:57,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:57,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:39:57,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:57,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:39:57,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:39:57,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:39:57,442 INFO L87 Difference]: Start difference. First operand 137 states and 710 transitions. Second operand 11 states. [2019-02-18 09:39:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:58,267 INFO L93 Difference]: Finished difference Result 197 states and 846 transitions. [2019-02-18 09:39:58,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:39:58,267 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-18 09:39:58,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:58,270 INFO L225 Difference]: With dead ends: 197 [2019-02-18 09:39:58,270 INFO L226 Difference]: Without dead ends: 196 [2019-02-18 09:39:58,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:39:58,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-02-18 09:39:58,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 140. [2019-02-18 09:39:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-02-18 09:39:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 728 transitions. [2019-02-18 09:39:58,378 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 728 transitions. Word has length 7 [2019-02-18 09:39:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:58,378 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 728 transitions. [2019-02-18 09:39:58,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:39:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 728 transitions. [2019-02-18 09:39:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:39:58,379 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:58,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:58,379 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:58,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:58,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 2 times [2019-02-18 09:39:58,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:58,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:58,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:58,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:58,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:58,613 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:58,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:58,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:58,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:58,614 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:58,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:58,614 INFO 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:39:58,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:39:58,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:39:58,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:39:58,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:58,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:58,632 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:58,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:58,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:39:58,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,647 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:58,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,736 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:58,736 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:58,762 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:58,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:58,788 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:58,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:58,816 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:58,816 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:39:58,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,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, 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:58,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:58,897 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:58,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:39:58,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:58,934 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:58,935 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:39:58,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:58,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:58,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-02-18 09:39:59,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-02-18 09:39:59,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:59,059 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:59,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-18 09:39:59,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:59,098 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:59,099 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:39:59,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:59,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:39:59,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:39:59,167 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:59,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:59,242 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:39:59,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:59,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:39:59,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:59,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:39:59,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:39:59,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:59,260 INFO L87 Difference]: Start difference. First operand 140 states and 728 transitions. Second operand 12 states. [2019-02-18 09:40:00,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:00,095 INFO L93 Difference]: Finished difference Result 195 states and 830 transitions. [2019-02-18 09:40:00,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:40:00,096 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 09:40:00,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:00,098 INFO L225 Difference]: With dead ends: 195 [2019-02-18 09:40:00,098 INFO L226 Difference]: Without dead ends: 189 [2019-02-18 09:40:00,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:40:00,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-02-18 09:40:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 139. [2019-02-18 09:40:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-18 09:40:00,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 721 transitions. [2019-02-18 09:40:00,237 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 721 transitions. Word has length 7 [2019-02-18 09:40:00,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:00,237 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 721 transitions. [2019-02-18 09:40:00,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:40:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 721 transitions. [2019-02-18 09:40:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:00,237 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:00,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:00,237 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:00,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:00,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2026977316, now seen corresponding path program 1 times [2019-02-18 09:40:00,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:00,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:00,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:40:00,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:00,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:00,417 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:40:00,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:00,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:00,417 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:00,418 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-02-18 09:40:00,420 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:00,420 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:00,422 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:00,422 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:40:00,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:00,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:00,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:00,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:40:00,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:00,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:00,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:00,443 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:00,447 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:00,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:40:00,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:40:00,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,476 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:00,477 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:00,496 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:00,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:00,516 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:00,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:00,540 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:00,540 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-18 09:40:00,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:40:00,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:00,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:40:00,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:40:00,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,630 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:00,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, 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:00,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:00,659 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:00,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-02-18 09:40:00,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:00,688 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:00,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:00,716 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:00,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:40:00,749 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:40:00,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:00,786 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:40:00,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:00,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:40:00,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:00,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:40:00,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:40:00,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:40:00,806 INFO L87 Difference]: Start difference. First operand 139 states and 721 transitions. Second operand 10 states. [2019-02-18 09:40:01,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:01,305 INFO L93 Difference]: Finished difference Result 157 states and 743 transitions. [2019-02-18 09:40:01,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:40:01,306 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:40:01,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:01,307 INFO L225 Difference]: With dead ends: 157 [2019-02-18 09:40:01,308 INFO L226 Difference]: Without dead ends: 156 [2019-02-18 09:40:01,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:40:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-02-18 09:40:01,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2019-02-18 09:40:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-18 09:40:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 718 transitions. [2019-02-18 09:40:01,421 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 718 transitions. Word has length 7 [2019-02-18 09:40:01,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:01,421 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 718 transitions. [2019-02-18 09:40:01,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:40:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 718 transitions. [2019-02-18 09:40:01,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:01,421 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:01,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:01,422 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:01,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:01,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2026986990, now seen corresponding path program 2 times [2019-02-18 09:40:01,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:01,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:01,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:01,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:01,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:01,786 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-02-18 09:40:01,873 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:01,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:01,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:01,873 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:40:01,873 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:40:01,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:01,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 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:40:01,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:40:01,884 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:40:01,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:40:01,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:40:01,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:01,894 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:01,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:01,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:01,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:40:01,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:01,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:01,921 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:40:01,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:01,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:01,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:01,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, 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:01,930 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:01,972 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:02,089 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:02,096 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:02,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:02,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:40:02,122 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-18 09:40:02,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:02,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:02,192 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:02,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:40:02,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,221 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:02,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:02,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:02,251 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:02,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-02-18 09:40:02,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:02,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:02,317 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:02,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-02-18 09:40:02,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:02,348 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:02,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:02,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:02,381 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:02,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:40:02,399 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:02,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:02,455 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:02,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:02,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:40:02,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:02,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:40:02,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:40:02,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:40:02,475 INFO L87 Difference]: Start difference. First operand 137 states and 718 transitions. Second operand 12 states. [2019-02-18 09:40:03,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:03,132 INFO L93 Difference]: Finished difference Result 178 states and 767 transitions. [2019-02-18 09:40:03,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:40:03,133 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 09:40:03,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:03,135 INFO L225 Difference]: With dead ends: 178 [2019-02-18 09:40:03,135 INFO L226 Difference]: Without dead ends: 177 [2019-02-18 09:40:03,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:40:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-18 09:40:03,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2019-02-18 09:40:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-18 09:40:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 634 transitions. [2019-02-18 09:40:03,244 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 634 transitions. Word has length 7 [2019-02-18 09:40:03,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:03,244 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 634 transitions. [2019-02-18 09:40:03,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:40:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 634 transitions. [2019-02-18 09:40:03,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:03,244 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:03,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:03,245 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:03,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:03,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 2 times [2019-02-18 09:40:03,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:03,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:03,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:40:03,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:03,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:03,421 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-02-18 09:40:03,523 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:03,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:03,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:03,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:40:03,524 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:40:03,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:03,524 INFO 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:40:03,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:40:03,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:40:03,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:40:03,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:40:03,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:03,541 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:03,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,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, 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:03,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:40:03,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:40:03,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:03,563 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:03,589 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,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 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 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:03,631 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,649 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:03,649 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:03,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:40:03,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:03,742 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,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:03,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,778 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:03,779 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:03,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:03,823 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,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-02-18 09:40:03,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-02-18 09:40:03,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:03,907 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:03,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-18 09:40:03,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:03,946 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:03,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 106 [2019-02-18 09:40:03,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:03,996 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:03,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:40:04,020 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:04,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:04,075 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:04,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:04,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:40:04,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:04,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:40:04,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:40:04,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:40:04,093 INFO L87 Difference]: Start difference. First operand 123 states and 634 transitions. Second operand 12 states. [2019-02-18 09:40:05,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:05,027 INFO L93 Difference]: Finished difference Result 204 states and 845 transitions. [2019-02-18 09:40:05,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:40:05,027 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 09:40:05,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:05,030 INFO L225 Difference]: With dead ends: 204 [2019-02-18 09:40:05,030 INFO L226 Difference]: Without dead ends: 203 [2019-02-18 09:40:05,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:40:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-18 09:40:05,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2019-02-18 09:40:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-02-18 09:40:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 654 transitions. [2019-02-18 09:40:05,134 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 654 transitions. Word has length 7 [2019-02-18 09:40:05,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:05,134 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 654 transitions. [2019-02-18 09:40:05,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:40:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 654 transitions. [2019-02-18 09:40:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:05,135 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:05,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:05,136 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:05,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:05,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2027156062, now seen corresponding path program 1 times [2019-02-18 09:40:05,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:05,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:05,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:40:05,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:05,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:05,245 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:40:05,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:05,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:05,245 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:05,245 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-02-18 09:40:05,246 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:05,246 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:05,248 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:05,248 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:40:05,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:05,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:05,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:05,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:40:05,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:05,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:05,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:05,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 18 treesize of output 21 [2019-02-18 09:40:05,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:05,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:40:05,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:40:05,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,367 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:05,367 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:05,386 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:05,397 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:05,407 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:05,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:05,432 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:05,432 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:40:05,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:05,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:05,498 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:05,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:40:05,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,520 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:05,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 33 treesize of output 60 [2019-02-18 09:40:05,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:05,546 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:05,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-18 09:40:05,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:05,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-02-18 09:40:05,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:05,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:05,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:40:05,623 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:40:05,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:05,654 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:40:05,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:05,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:40:05,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:05,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:40:05,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:40:05,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:40:05,672 INFO L87 Difference]: Start difference. First operand 126 states and 654 transitions. Second operand 10 states. [2019-02-18 09:40:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:06,220 INFO L93 Difference]: Finished difference Result 178 states and 835 transitions. [2019-02-18 09:40:06,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:40:06,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:40:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:06,222 INFO L225 Difference]: With dead ends: 178 [2019-02-18 09:40:06,223 INFO L226 Difference]: Without dead ends: 177 [2019-02-18 09:40:06,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:40:06,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-18 09:40:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 108. [2019-02-18 09:40:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-18 09:40:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 546 transitions. [2019-02-18 09:40:06,320 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 546 transitions. Word has length 7 [2019-02-18 09:40:06,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:06,320 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 546 transitions. [2019-02-18 09:40:06,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:40:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 546 transitions. [2019-02-18 09:40:06,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:06,321 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:06,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:06,321 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:06,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:06,322 INFO L82 PathProgramCache]: Analyzing trace with hash -2023162082, now seen corresponding path program 1 times [2019-02-18 09:40:06,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:06,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:06,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:06,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:06,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:06,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:06,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:06,404 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:06,404 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [29] [2019-02-18 09:40:06,405 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:06,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:06,407 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:06,407 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:40:06,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:06,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:06,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:06,408 INFO 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:40:06,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:06,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:06,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:06,426 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:06,432 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:06,439 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:06,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:06,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-18 09:40:06,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:06,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:06,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-18 09:40:06,463 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:06,477 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:06,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:06,495 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:06,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:06,518 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:06,519 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-02-18 09:40:06,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:06,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:06,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:06,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:06,549 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:40:06,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:06,564 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:06,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:40:06,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:06,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:06,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:06,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:06,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:06,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:06,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-18 09:40:06,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:06,614 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:06,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-18 09:40:06,629 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:06,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:06,648 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:06,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:06,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:40:06,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:06,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:40:06,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:40:06,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:40:06,668 INFO L87 Difference]: Start difference. First operand 108 states and 546 transitions. Second operand 8 states. [2019-02-18 09:40:07,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:07,013 INFO L93 Difference]: Finished difference Result 134 states and 591 transitions. [2019-02-18 09:40:07,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:40:07,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-18 09:40:07,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:07,015 INFO L225 Difference]: With dead ends: 134 [2019-02-18 09:40:07,015 INFO L226 Difference]: Without dead ends: 133 [2019-02-18 09:40:07,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 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:40:07,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-02-18 09:40:07,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2019-02-18 09:40:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-18 09:40:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-02-18 09:40:07,112 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-02-18 09:40:07,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:07,112 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-02-18 09:40:07,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:40:07,112 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-02-18 09:40:07,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:07,113 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:07,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:07,113 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:07,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:07,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1962747920, now seen corresponding path program 1 times [2019-02-18 09:40:07,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:07,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:07,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:07,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:07,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:07,250 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:40:07,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:07,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:07,251 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:07,251 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [27] [2019-02-18 09:40:07,252 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:07,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:07,254 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:07,254 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:40:07,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:07,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:07,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:07,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:40:07,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:07,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:07,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:07,285 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:07,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,323 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:07,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,327 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:07,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,332 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:07,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,340 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:07,340 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:07,367 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:07,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:07,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:07,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:07,419 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:07,419 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:07,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,453 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:07,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:07,493 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:07,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:07,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:40:07,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:07,573 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:07,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:07,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:07,608 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:07,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:40:07,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:07,656 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:07,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:07,678 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:40:07,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:07,719 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:40:07,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:07,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:40:07,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:07,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:40:07,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:40:07,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:40:07,737 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-02-18 09:40:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:08,325 INFO L93 Difference]: Finished difference Result 143 states and 604 transitions. [2019-02-18 09:40:08,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:40:08,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:40:08,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:08,328 INFO L225 Difference]: With dead ends: 143 [2019-02-18 09:40:08,328 INFO L226 Difference]: Without dead ends: 142 [2019-02-18 09:40:08,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:40:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-02-18 09:40:08,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2019-02-18 09:40:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-18 09:40:08,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-02-18 09:40:08,427 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-02-18 09:40:08,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:08,427 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-02-18 09:40:08,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:40:08,428 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-02-18 09:40:08,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:08,428 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:08,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:08,428 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:08,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:08,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1962509592, now seen corresponding path program 1 times [2019-02-18 09:40:08,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:08,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:08,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:08,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:08,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:08,641 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-02-18 09:40:08,670 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:40:08,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:08,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:08,670 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:08,670 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [27] [2019-02-18 09:40:08,671 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:08,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:08,675 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:08,675 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:40:08,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:08,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:08,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:08,675 INFO 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:40:08,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:08,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:08,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:08,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, 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:08,767 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:08,860 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:08,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:08,975 INFO L303 Elim1Store]: Index analysis took 113 ms [2019-02-18 09:40:08,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-18 09:40:08,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:08,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:08,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-18 09:40:08,988 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,002 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,020 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,043 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:09,043 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-18 09:40:09,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 09:40:09,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,087 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:09,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:40:09,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,107 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:40:09,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,125 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:09,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:40:09,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,145 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:09,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 56 [2019-02-18 09:40:09,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,166 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:09,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-18 09:40:09,180 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:40:09,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:09,203 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:40:09,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:09,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:40:09,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:09,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:40:09,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:40:09,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:40:09,221 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-02-18 09:40:09,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:09,688 INFO L93 Difference]: Finished difference Result 151 states and 642 transitions. [2019-02-18 09:40:09,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:40:09,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:40:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:09,690 INFO L225 Difference]: With dead ends: 151 [2019-02-18 09:40:09,691 INFO L226 Difference]: Without dead ends: 150 [2019-02-18 09:40:09,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:40:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-02-18 09:40:09,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2019-02-18 09:40:09,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-18 09:40:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 615 transitions. [2019-02-18 09:40:09,798 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 615 transitions. Word has length 7 [2019-02-18 09:40:09,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:09,799 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 615 transitions. [2019-02-18 09:40:09,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:40:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 615 transitions. [2019-02-18 09:40:09,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:09,799 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:09,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:09,799 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:09,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:09,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1973605362, now seen corresponding path program 1 times [2019-02-18 09:40:09,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:09,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:09,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:09,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:09,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:09,946 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:09,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:09,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:09,947 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:09,947 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-02-18 09:40:09,948 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:09,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:09,949 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:09,949 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:40:09,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:09,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:09,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:09,950 INFO 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:40:09,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:09,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:09,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:09,967 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:09,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,974 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:09,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,979 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:09,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,988 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:09,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:09,998 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,129 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,143 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,154 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,164 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,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:10,182 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:10,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,214 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:10,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,254 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,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:10,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,288 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:10,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 09:40:10,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,330 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,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:10,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,367 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:10,367 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:10,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,411 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,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:10,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,441 INFO L701 Elim1Store]: detected not equals via solver [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,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:10,451 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:10,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:10,497 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,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:10,520 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,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:10,561 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:40:10,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:10,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:40:10,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:10,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:40:10,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:40:10,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:40:10,579 INFO L87 Difference]: Start difference. First operand 121 states and 615 transitions. Second operand 12 states. [2019-02-18 09:40:11,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:11,393 INFO L93 Difference]: Finished difference Result 215 states and 931 transitions. [2019-02-18 09:40:11,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:40:11,394 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 09:40:11,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:11,396 INFO L225 Difference]: With dead ends: 215 [2019-02-18 09:40:11,396 INFO L226 Difference]: Without dead ends: 214 [2019-02-18 09:40:11,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:40:11,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-02-18 09:40:11,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 142. [2019-02-18 09:40:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-02-18 09:40:11,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 741 transitions. [2019-02-18 09:40:11,523 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 741 transitions. Word has length 7 [2019-02-18 09:40:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:11,523 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 741 transitions. [2019-02-18 09:40:11,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:40:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 741 transitions. [2019-02-18 09:40:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:11,524 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:11,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:11,524 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:11,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:11,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-02-18 09:40:11,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:11,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:11,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:11,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:11,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:11,543 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:11,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:11,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:11,544 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:11,544 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-02-18 09:40:11,545 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:11,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:11,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:11,547 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:40:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:11,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:11,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:11,548 INFO 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:40:11,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:11,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:11,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:11,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:11,580 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:11,584 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:11,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:11,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:11,608 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,618 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,639 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,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:40:11,659 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-02-18 09:40:11,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:11,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-18 09:40:11,750 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:11,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:11,758 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:11,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:40:11,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-18 09:40:11,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:40:11,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:40:11,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:40:11,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:40:11,776 INFO L87 Difference]: Start difference. First operand 142 states and 741 transitions. Second operand 4 states. [2019-02-18 09:40:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:12,092 INFO L93 Difference]: Finished difference Result 280 states and 1413 transitions. [2019-02-18 09:40:12,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:40:12,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-18 09:40:12,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:12,095 INFO L225 Difference]: With dead ends: 280 [2019-02-18 09:40:12,095 INFO L226 Difference]: Without dead ends: 275 [2019-02-18 09:40:12,096 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:12,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-02-18 09:40:12,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 252. [2019-02-18 09:40:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-02-18 09:40:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 1379 transitions. [2019-02-18 09:40:12,356 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 1379 transitions. Word has length 7 [2019-02-18 09:40:12,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:12,356 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 1379 transitions. [2019-02-18 09:40:12,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:40:12,356 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 1379 transitions. [2019-02-18 09:40:12,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:12,357 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:12,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:12,358 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:12,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:12,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1970145762, now seen corresponding path program 2 times [2019-02-18 09:40:12,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:12,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:12,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:12,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:12,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:12,946 WARN L181 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-02-18 09:40:13,013 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:13,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:13,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:13,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:40:13,014 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:40:13,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:13,014 INFO 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:40:13,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:40:13,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:40:13,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:40:13,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:40:13,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:13,036 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:13,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,038 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:13,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,043 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:13,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:13,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,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, 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:13,058 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:13,084 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:13,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:13,108 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:13,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:13,134 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:13,135 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:13,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,167 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:13,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:13,205 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:13,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:13,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,244 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:13,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:13,294 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:13,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:13,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,330 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:13,330 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:13,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:13,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:13,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:13,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:13,417 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:13,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:13,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:13,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:13,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:13,489 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:13,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:13,539 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:13,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:13,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:40:13,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:13,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:40:13,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:40:13,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:40:13,558 INFO L87 Difference]: Start difference. First operand 252 states and 1379 transitions. Second operand 11 states. [2019-02-18 09:40:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:14,542 INFO L93 Difference]: Finished difference Result 329 states and 1634 transitions. [2019-02-18 09:40:14,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:40:14,543 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-18 09:40:14,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:14,547 INFO L225 Difference]: With dead ends: 329 [2019-02-18 09:40:14,547 INFO L226 Difference]: Without dead ends: 328 [2019-02-18 09:40:14,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:40:14,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-02-18 09:40:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 271. [2019-02-18 09:40:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-02-18 09:40:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 1494 transitions. [2019-02-18 09:40:14,827 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 1494 transitions. Word has length 7 [2019-02-18 09:40:14,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:14,827 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 1494 transitions. [2019-02-18 09:40:14,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:40:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 1494 transitions. [2019-02-18 09:40:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:14,828 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:14,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:14,828 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:14,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-02-18 09:40:14,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:14,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:14,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:40:14,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:14,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:14,956 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:14,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:14,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:14,957 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:14,957 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-02-18 09:40:14,958 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:14,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:14,960 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:14,960 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:40:14,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:14,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:14,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:14,960 INFO 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:40:14,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:14,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:14,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:14,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:40:14,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:40:14,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:14,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:40:15,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:40:15,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:40:15,014 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:15,033 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:15,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:15,053 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:15,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:15,078 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:15,078 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:40:15,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,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, 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:40:15,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:15,137 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:15,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:40:15,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:15,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40: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 65 [2019-02-18 09:40:15,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:15,194 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:15,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:40:15,213 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:15,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:15,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:15,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:40:15,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:15,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:40:15,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:40:15,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:40:15,254 INFO L87 Difference]: Start difference. First operand 271 states and 1494 transitions. Second operand 8 states. [2019-02-18 09:40:15,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:15,799 INFO L93 Difference]: Finished difference Result 290 states and 1522 transitions. [2019-02-18 09:40:15,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:40:15,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-18 09:40:15,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:15,803 INFO L225 Difference]: With dead ends: 290 [2019-02-18 09:40:15,803 INFO L226 Difference]: Without dead ends: 286 [2019-02-18 09:40:15,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 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:40:15,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-02-18 09:40:16,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 273. [2019-02-18 09:40:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-02-18 09:40:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 1505 transitions. [2019-02-18 09:40:16,072 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 1505 transitions. Word has length 7 [2019-02-18 09:40:16,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:16,073 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 1505 transitions. [2019-02-18 09:40:16,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:40:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 1505 transitions. [2019-02-18 09:40:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:16,074 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:16,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:16,074 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:16,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:16,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1966084512, now seen corresponding path program 2 times [2019-02-18 09:40:16,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:16,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:16,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:16,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:16,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:16,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:16,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:16,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:40:16,208 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:40:16,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:16,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:40:16,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:40:16,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:40:16,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:40:16,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:40:16,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:16,231 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:16,242 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:16,249 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:16,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-18 09:40:16,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-18 09:40:16,275 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:16,289 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:16,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:16,307 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:16,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:16,329 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:16,330 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-18 09:40:16,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,362 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:40:16,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:16,377 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:16,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:40:16,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,398 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:16,398 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 42 [2019-02-18 09:40:16,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:16,416 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:16,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:40:16,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:16,438 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:40:16,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:16,456 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:16,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:40:16,471 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:40:16,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:16,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:16,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:40:16,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:16,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:40:16,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:40:16,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:40:16,525 INFO L87 Difference]: Start difference. First operand 273 states and 1505 transitions. Second operand 10 states. [2019-02-18 09:40:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:17,112 INFO L93 Difference]: Finished difference Result 307 states and 1547 transitions. [2019-02-18 09:40:17,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:40:17,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:40:17,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:17,116 INFO L225 Difference]: With dead ends: 307 [2019-02-18 09:40:17,116 INFO L226 Difference]: Without dead ends: 302 [2019-02-18 09:40:17,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:40:17,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-02-18 09:40:17,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 247. [2019-02-18 09:40:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-02-18 09:40:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 1348 transitions. [2019-02-18 09:40:17,380 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 1348 transitions. Word has length 7 [2019-02-18 09:40:17,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:17,380 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 1348 transitions. [2019-02-18 09:40:17,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:40:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 1348 transitions. [2019-02-18 09:40:17,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:17,381 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:17,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:17,381 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:17,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:17,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1966448270, now seen corresponding path program 3 times [2019-02-18 09:40:17,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:17,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:17,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:40:17,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:17,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:17,596 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:40:17,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:17,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:17,597 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:40:17,597 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:40:17,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:17,597 INFO 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:40:17,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:40:17,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:40:17,612 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:40:17,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:40:17,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:17,618 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:17,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,622 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,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,628 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,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,637 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,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,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, 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:17,647 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:17,673 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,687 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,698 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,708 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,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:17,724 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:17,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,765 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:17,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:17,803 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:17,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:17,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,845 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:17,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, 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:17,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:17,884 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:17,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:17,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,927 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:17,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 09:40:17,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:17,969 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:17,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:17,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:17,998 INFO L701 Elim1Store]: detected not equals via solver [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 L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:40:18,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:18,052 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,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:18,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,091 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:18,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:18,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, 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:40:18,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:18,140 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:18,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:40:18,172 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:40:18,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:18,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:18,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-18 09:40:18,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:18,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:40:18,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:40:18,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:40:18,276 INFO L87 Difference]: Start difference. First operand 247 states and 1348 transitions. Second operand 14 states. [2019-02-18 09:40:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:19,557 INFO L93 Difference]: Finished difference Result 284 states and 1398 transitions. [2019-02-18 09:40:19,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:40:19,558 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-18 09:40:19,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:19,561 INFO L225 Difference]: With dead ends: 284 [2019-02-18 09:40:19,561 INFO L226 Difference]: Without dead ends: 279 [2019-02-18 09:40:19,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-02-18 09:40:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-02-18 09:40:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 195. [2019-02-18 09:40:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-02-18 09:40:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 1030 transitions. [2019-02-18 09:40:19,821 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 1030 transitions. Word has length 7 [2019-02-18 09:40:19,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:19,821 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 1030 transitions. [2019-02-18 09:40:19,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:40:19,821 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 1030 transitions. [2019-02-18 09:40:19,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:19,822 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:19,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:19,822 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:19,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:19,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1931949486, now seen corresponding path program 1 times [2019-02-18 09:40:19,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:19,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:19,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:40:19,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:19,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:19,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:40:19,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:19,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:19,880 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:19,880 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-02-18 09:40:19,881 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:19,881 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:19,883 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:19,884 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:40:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:19,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:19,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:19,884 INFO 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:40:19,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:19,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:19,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:19,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 18 treesize of output 21 [2019-02-18 09:40:19,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:19,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, 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:19,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:19,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:19,913 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:19,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:19,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:19,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:19,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:19,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:19,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:19,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:19,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:19,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:19,932 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:19,960 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:19,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:19,987 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:19,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:20,013 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:20,013 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:20,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,042 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:20,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:20,081 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:20,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:20,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:20,115 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:40:20,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:20,159 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:20,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:20,177 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:20,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:20,187 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:20,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:20,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:40:20,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:20,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:40:20,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:40:20,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:40:20,206 INFO L87 Difference]: Start difference. First operand 195 states and 1030 transitions. Second operand 8 states. [2019-02-18 09:40:20,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:20,717 INFO L93 Difference]: Finished difference Result 230 states and 1135 transitions. [2019-02-18 09:40:20,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:40:20,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-18 09:40:20,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:20,720 INFO L225 Difference]: With dead ends: 230 [2019-02-18 09:40:20,720 INFO L226 Difference]: Without dead ends: 223 [2019-02-18 09:40:20,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:40:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-02-18 09:40:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 209. [2019-02-18 09:40:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-02-18 09:40:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 1112 transitions. [2019-02-18 09:40:20,995 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 1112 transitions. Word has length 7 [2019-02-18 09:40:20,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:20,995 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 1112 transitions. [2019-02-18 09:40:20,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:40:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 1112 transitions. [2019-02-18 09:40:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:20,996 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:20,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:20,996 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:20,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:20,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1931649590, now seen corresponding path program 1 times [2019-02-18 09:40:20,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:20,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:20,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:20,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:20,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:21,099 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:40:21,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:21,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:21,100 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:21,100 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [27] [2019-02-18 09:40:21,101 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:21,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:21,103 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:21,104 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:40:21,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:21,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:21,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:21,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:40:21,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:21,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:21,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:21,127 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:21,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,130 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:21,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,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, 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:21,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,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, 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:21,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,150 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:21,150 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:21,177 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:21,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:21,201 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:21,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:21,228 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:21,229 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:21,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,260 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:21,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:21,301 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:21,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:21,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:40:21,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:21,382 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:21,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:21,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:21,417 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:21,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-02-18 09:40:21,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:21,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:21,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:21,485 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:40:21,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:21,504 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:40:21,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:21,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-18 09:40:21,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:21,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:40:21,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:40:21,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:40:21,524 INFO L87 Difference]: Start difference. First operand 209 states and 1112 transitions. Second operand 9 states. [2019-02-18 09:40:22,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:22,193 INFO L93 Difference]: Finished difference Result 254 states and 1212 transitions. [2019-02-18 09:40:22,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:40:22,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-18 09:40:22,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:22,196 INFO L225 Difference]: With dead ends: 254 [2019-02-18 09:40:22,196 INFO L226 Difference]: Without dead ends: 253 [2019-02-18 09:40:22,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:40:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-02-18 09:40:22,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 215. [2019-02-18 09:40:22,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-02-18 09:40:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1148 transitions. [2019-02-18 09:40:22,477 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1148 transitions. Word has length 7 [2019-02-18 09:40:22,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:22,477 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1148 transitions. [2019-02-18 09:40:22,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:40:22,477 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1148 transitions. [2019-02-18 09:40:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:22,478 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:22,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:22,478 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:22,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:22,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1933796528, now seen corresponding path program 1 times [2019-02-18 09:40:22,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:22,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:22,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:22,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:22,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:22,700 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-18 09:40:22,710 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:22,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:22,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:22,711 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:22,711 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-02-18 09:40:22,712 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:22,712 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:22,715 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:22,715 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:40:22,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:22,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:22,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:22,716 INFO 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:40:22,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:22,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:22,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:22,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:40:22,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:22,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,764 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:22,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:22,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,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, 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:22,784 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:22,810 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:22,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:22,835 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:22,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:22,862 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:22,862 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:22,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,898 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:22,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:22,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:22,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:22,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:22,971 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:22,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, 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:22,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:23,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:23,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:23,031 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:23,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:23,049 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:23,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:23,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-18 09:40:23,068 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:23,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:40:23,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:40:23,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:40:23,069 INFO L87 Difference]: Start difference. First operand 215 states and 1148 transitions. Second operand 7 states. [2019-02-18 09:40:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:23,525 INFO L93 Difference]: Finished difference Result 223 states and 1160 transitions. [2019-02-18 09:40:23,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:40:23,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-18 09:40:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:23,527 INFO L225 Difference]: With dead ends: 223 [2019-02-18 09:40:23,527 INFO L226 Difference]: Without dead ends: 216 [2019-02-18 09:40:23,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:40:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-02-18 09:40:23,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-02-18 09:40:23,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-02-18 09:40:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1147 transitions. [2019-02-18 09:40:23,812 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1147 transitions. Word has length 7 [2019-02-18 09:40:23,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:23,812 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1147 transitions. [2019-02-18 09:40:23,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:40:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1147 transitions. [2019-02-18 09:40:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:23,813 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:23,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:23,813 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:23,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:23,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 3 times [2019-02-18 09:40:23,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:23,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:23,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:23,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:23,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:24,014 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-02-18 09:40:24,124 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:24,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:24,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:24,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:40:24,125 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:40:24,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:24,125 INFO 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:40:24,135 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:40:24,136 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:40:24,140 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:40:24,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:40:24,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:24,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:40:24,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,157 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:24,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,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:40:24,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:40:24,174 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:24,207 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,222 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,232 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,242 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,259 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:24,260 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:24,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:24,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:24,334 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:24,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:24,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,370 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:24,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:24,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:24,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:24,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,468 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:24,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:24,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:24,513 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:24,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:24,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:24,558 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:24,559 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:24,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:24,602 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:24,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:24,631 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:24,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:24,696 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:24,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:24,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:40:24,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:24,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:40:24,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:40:24,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:40:24,714 INFO L87 Difference]: Start difference. First operand 215 states and 1147 transitions. Second operand 12 states. [2019-02-18 09:40:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:25,761 INFO L93 Difference]: Finished difference Result 285 states and 1372 transitions. [2019-02-18 09:40:25,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:40:25,762 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 09:40:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:25,765 INFO L225 Difference]: With dead ends: 285 [2019-02-18 09:40:25,766 INFO L226 Difference]: Without dead ends: 279 [2019-02-18 09:40:25,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-02-18 09:40:25,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-02-18 09:40:26,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 186. [2019-02-18 09:40:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-02-18 09:40:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 973 transitions. [2019-02-18 09:40:26,028 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 973 transitions. Word has length 7 [2019-02-18 09:40:26,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:26,028 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 973 transitions. [2019-02-18 09:40:26,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:40:26,028 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 973 transitions. [2019-02-18 09:40:26,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:26,029 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:26,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:26,029 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:26,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:26,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1928074670, now seen corresponding path program 2 times [2019-02-18 09:40:26,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:26,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:26,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:40:26,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:26,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:26,132 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:40:26,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:26,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:26,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:40:26,133 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:40:26,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:26,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:40:26,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:40:26,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:40:26,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:40:26,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:40:26,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:26,153 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:26,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,159 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:26,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,162 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:26,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,168 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:26,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,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, 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:26,177 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:26,203 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:26,217 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:26,228 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:26,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:26,255 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:26,256 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:26,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:40:26,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:26,334 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:26,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:26,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,371 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:26,372 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:26,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:26,414 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:26,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:26,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:26,451 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:40:26,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:26,495 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:26,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:26,516 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:40:26,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:26,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:26,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:40:26,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:26,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:40:26,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:40:26,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:40:26,566 INFO L87 Difference]: Start difference. First operand 186 states and 973 transitions. Second operand 10 states. [2019-02-18 09:40:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:27,330 INFO L93 Difference]: Finished difference Result 252 states and 1178 transitions. [2019-02-18 09:40:27,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:40:27,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:40:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:27,334 INFO L225 Difference]: With dead ends: 252 [2019-02-18 09:40:27,334 INFO L226 Difference]: Without dead ends: 247 [2019-02-18 09:40:27,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:40:27,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-02-18 09:40:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 178. [2019-02-18 09:40:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-18 09:40:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 925 transitions. [2019-02-18 09:40:27,582 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 925 transitions. Word has length 7 [2019-02-18 09:40:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:27,583 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 925 transitions. [2019-02-18 09:40:27,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:40:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 925 transitions. [2019-02-18 09:40:27,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:27,583 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:27,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:27,583 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:27,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:27,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-02-18 09:40:27,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:27,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:27,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:40:27,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:27,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:27,665 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:27,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:27,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:27,665 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:27,665 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-02-18 09:40:27,666 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:27,666 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:27,667 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:27,668 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:40:27,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:27,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:27,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:27,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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:27,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:27,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:27,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:27,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:27,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,687 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:27,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:40:27,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,703 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:27,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,710 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:27,710 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:27,737 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:27,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:27,762 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:27,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:27,787 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:27,788 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:27,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,817 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:27,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:27,857 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:27,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:27,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:27,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:40:27,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:27,929 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:27,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:27,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:27,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:27,969 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:27,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:27,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-18 09:40:27,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:27,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:40:27,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:40:27,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:40:27,988 INFO L87 Difference]: Start difference. First operand 178 states and 925 transitions. Second operand 7 states. [2019-02-18 09:40:28,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:28,463 INFO L93 Difference]: Finished difference Result 194 states and 950 transitions. [2019-02-18 09:40:28,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:40:28,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-18 09:40:28,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:28,465 INFO L225 Difference]: With dead ends: 194 [2019-02-18 09:40:28,465 INFO L226 Difference]: Without dead ends: 193 [2019-02-18 09:40:28,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:40:28,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-02-18 09:40:28,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2019-02-18 09:40:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-02-18 09:40:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 931 transitions. [2019-02-18 09:40:28,722 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 931 transitions. Word has length 7 [2019-02-18 09:40:28,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:28,722 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 931 transitions. [2019-02-18 09:40:28,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:40:28,722 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 931 transitions. [2019-02-18 09:40:28,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:28,722 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:28,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:28,723 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:28,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:28,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2134403662, now seen corresponding path program 2 times [2019-02-18 09:40:28,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:28,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:28,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:28,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:28,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:28,842 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:40:28,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:28,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:28,842 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:40:28,843 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:40:28,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:28,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:28,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:40:28,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:40:28,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:40:28,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:40:28,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:28,862 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:28,865 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:28,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:28,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:40:28,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:28,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:28,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:40:28,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:28,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:28,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:28,900 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:28,900 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:28,919 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:28,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:28,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:28,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:28,964 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:28,964 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:40:29,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,124 INFO L303 Elim1Store]: Index analysis took 127 ms [2019-02-18 09:40:29,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, 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:40:29,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:29,150 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:29,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:40:29,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,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 31 treesize of output 57 [2019-02-18 09:40:29,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:29,205 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:29,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:40:29,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,240 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:29,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:29,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:40:29,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:29,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:29,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-18 09:40:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:29,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:29,324 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:40:29,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:29,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:40:29,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:29,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:40:29,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:40:29,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:40:29,343 INFO L87 Difference]: Start difference. First operand 179 states and 931 transitions. Second operand 10 states. [2019-02-18 09:40:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:30,178 INFO L93 Difference]: Finished difference Result 265 states and 1253 transitions. [2019-02-18 09:40:30,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:40:30,179 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:40:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:30,181 INFO L225 Difference]: With dead ends: 265 [2019-02-18 09:40:30,181 INFO L226 Difference]: Without dead ends: 264 [2019-02-18 09:40:30,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:40:30,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-02-18 09:40:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 202. [2019-02-18 09:40:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-02-18 09:40:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1068 transitions. [2019-02-18 09:40:30,502 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1068 transitions. Word has length 7 [2019-02-18 09:40:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:30,502 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1068 transitions. [2019-02-18 09:40:30,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:40:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1068 transitions. [2019-02-18 09:40:30,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:30,503 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:30,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:30,503 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:30,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:30,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2132137560, now seen corresponding path program 1 times [2019-02-18 09:40:30,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:30,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:30,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:40:30,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:30,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:30,566 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:30,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:30,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:30,567 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:30,567 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-02-18 09:40:30,568 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:30,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:30,570 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:30,570 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:40:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:30,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:30,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:30,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:30,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:30,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:30,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:30,590 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:30,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:30,604 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:30,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:30,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-18 09:40:30,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:30,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:30,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-18 09:40:30,635 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:30,649 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:30,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:30,668 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:30,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:30,689 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:30,689 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-18 09:40:30,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:30,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:30,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:30,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:30,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, 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:40:30,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:30,734 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:30,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:40:30,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:30,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:30,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:30,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:30,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:30,753 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:30,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, 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 42 [2019-02-18 09:40:30,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:30,771 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:30,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:40:30,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:40:30,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:30,805 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:30,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:30,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-18 09:40:30,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:30,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:40:30,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:40:30,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:40:30,824 INFO L87 Difference]: Start difference. First operand 202 states and 1068 transitions. Second operand 7 states. [2019-02-18 09:40:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:31,290 INFO L93 Difference]: Finished difference Result 210 states and 1080 transitions. [2019-02-18 09:40:31,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:40:31,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-18 09:40:31,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:31,292 INFO L225 Difference]: With dead ends: 210 [2019-02-18 09:40:31,292 INFO L226 Difference]: Without dead ends: 203 [2019-02-18 09:40:31,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:40:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-18 09:40:31,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-02-18 09:40:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-02-18 09:40:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1066 transitions. [2019-02-18 09:40:31,626 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1066 transitions. Word has length 7 [2019-02-18 09:40:31,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:31,626 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1066 transitions. [2019-02-18 09:40:31,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:40:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1066 transitions. [2019-02-18 09:40:31,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:40:31,627 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:31,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:31,627 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:31,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:31,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2141372770, now seen corresponding path program 1 times [2019-02-18 09:40:31,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:31,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:31,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:31,823 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-02-18 09:40:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:40:31,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:31,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:31,841 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:40:31,841 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [29] [2019-02-18 09:40:31,841 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:31,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:31,843 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:31,844 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:40:31,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:31,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:31,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:31,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:31,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:31,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:31,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:31,860 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:31,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:40:31,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:31,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:40:31,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:31,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:31,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:40:31,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:31,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:31,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:31,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:40:31,922 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:31,939 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:31,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:31,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:31,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:31,984 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:31,984 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:40:32,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:40:32,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:32,048 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,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:40:32,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:32,073 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:40:32,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:32,103 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,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:40:32,122 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:32,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:32,394 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:32,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:32,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-18 09:40:32,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:32,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:40:32,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:40:32,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:40:32,413 INFO L87 Difference]: Start difference. First operand 202 states and 1066 transitions. Second operand 7 states. [2019-02-18 09:40:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:32,963 INFO L93 Difference]: Finished difference Result 216 states and 1089 transitions. [2019-02-18 09:40:32,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:40:32,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-18 09:40:32,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:32,965 INFO L225 Difference]: With dead ends: 216 [2019-02-18 09:40:32,965 INFO L226 Difference]: Without dead ends: 212 [2019-02-18 09:40:32,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:40:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-02-18 09:40:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 204. [2019-02-18 09:40:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-02-18 09:40:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 1077 transitions. [2019-02-18 09:40:33,319 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 1077 transitions. Word has length 7 [2019-02-18 09:40:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:33,319 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 1077 transitions. [2019-02-18 09:40:33,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:40:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 1077 transitions. [2019-02-18 09:40:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:40:33,320 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:33,320 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:33,320 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:33,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:33,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1804316618, now seen corresponding path program 2 times [2019-02-18 09:40:33,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:33,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:33,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:33,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:33,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:33,399 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:40:33,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:33,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:33,400 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:40:33,400 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:40:33,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:33,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:33,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:40:33,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:40:33,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:40:33,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:40:33,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:33,421 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:33,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,426 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:33,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,433 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:33,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,440 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:33,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:33,446 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:33,473 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:33,485 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:33,496 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:33,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:33,523 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:33,523 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:33,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:40:33,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:33,590 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:33,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:33,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,622 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:40:33,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:33,666 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:33,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-02-18 09:40:33,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:33,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:40:33,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:33,747 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,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:33,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:33,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:33,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:40:33,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:33,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:40:33,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:40:33,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:40:33,810 INFO L87 Difference]: Start difference. First operand 204 states and 1077 transitions. Second operand 10 states. [2019-02-18 09:40:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:34,816 INFO L93 Difference]: Finished difference Result 401 states and 2015 transitions. [2019-02-18 09:40:34,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:40:34,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-18 09:40:34,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:34,819 INFO L225 Difference]: With dead ends: 401 [2019-02-18 09:40:34,819 INFO L226 Difference]: Without dead ends: 397 [2019-02-18 09:40:34,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:40:34,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-02-18 09:40:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 342. [2019-02-18 09:40:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-02-18 09:40:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1889 transitions. [2019-02-18 09:40:35,423 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1889 transitions. Word has length 8 [2019-02-18 09:40:35,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:35,423 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1889 transitions. [2019-02-18 09:40:35,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:40:35,423 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1889 transitions. [2019-02-18 09:40:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:40:35,424 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:35,424 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:35,424 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:35,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:35,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1821001564, now seen corresponding path program 1 times [2019-02-18 09:40:35,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:35,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:35,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:40:35,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:35,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:35,475 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:40:35,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:40:35,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 09:40:35,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:40:35,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:40:35,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:40:35,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:40:35,476 INFO L87 Difference]: Start difference. First operand 342 states and 1889 transitions. Second operand 4 states. [2019-02-18 09:40:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:36,090 INFO L93 Difference]: Finished difference Result 347 states and 1893 transitions. [2019-02-18 09:40:36,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:40:36,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-02-18 09:40:36,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:36,092 INFO L225 Difference]: With dead ends: 347 [2019-02-18 09:40:36,092 INFO L226 Difference]: Without dead ends: 342 [2019-02-18 09:40:36,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:40:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-02-18 09:40:36,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-02-18 09:40:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-02-18 09:40:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1887 transitions. [2019-02-18 09:40:36,699 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1887 transitions. Word has length 8 [2019-02-18 09:40:36,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:36,699 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1887 transitions. [2019-02-18 09:40:36,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:40:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1887 transitions. [2019-02-18 09:40:36,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:40:36,700 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:36,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:36,700 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:36,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:36,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1861261506, now seen corresponding path program 1 times [2019-02-18 09:40:36,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:36,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:36,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:36,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:36,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:36,920 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:40:36,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:36,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:36,921 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:40:36,921 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-02-18 09:40:36,922 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:36,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:36,923 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:36,923 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 09:40:36,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:36,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:36,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:36,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:36,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:36,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:36,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:36,942 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:36,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:36,946 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:36,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:36,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:36,960 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:36,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:36,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:36,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:36,965 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:36,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:36,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:36,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:36,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:36,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, 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:36,972 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:37,075 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:37,089 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:37,100 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:37,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:37,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:37,128 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:37,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:40:37,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:37,201 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:37,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:37,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,236 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:40:37,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:37,279 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:37,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:37,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,320 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:37,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:40:37,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:37,369 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:37,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:37,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,422 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:37,423 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:37,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:37,484 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:37,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:37,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,520 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:37,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:37,522 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:40:37,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:37,567 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:37,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:40:37,589 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:40:37,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:37,654 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:40:37,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:37,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-18 09:40:37,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:37,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:40:37,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:40:37,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:40:37,674 INFO L87 Difference]: Start difference. First operand 342 states and 1887 transitions. Second operand 13 states. [2019-02-18 09:40:39,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:39,316 INFO L93 Difference]: Finished difference Result 471 states and 2470 transitions. [2019-02-18 09:40:39,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:40:39,317 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-18 09:40:39,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:39,319 INFO L225 Difference]: With dead ends: 471 [2019-02-18 09:40:39,319 INFO L226 Difference]: Without dead ends: 470 [2019-02-18 09:40:39,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:40:39,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-02-18 09:40:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 359. [2019-02-18 09:40:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-02-18 09:40:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1989 transitions. [2019-02-18 09:40:39,964 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1989 transitions. Word has length 8 [2019-02-18 09:40:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:39,964 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 1989 transitions. [2019-02-18 09:40:39,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:40:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1989 transitions. [2019-02-18 09:40:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:40:39,965 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:39,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:39,965 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:39,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:39,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1864721106, now seen corresponding path program 2 times [2019-02-18 09:40:39,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:39,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:39,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:39,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:39,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:40,151 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:40:40,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:40,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:40,152 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:40:40,152 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:40:40,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:40,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:40,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:40:40,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:40:40,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-18 09:40:40,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:40:40,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:40,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:40,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:40:40,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,182 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:40,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:40:40,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:40,208 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:40,232 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:40,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:40,257 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:40,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:40,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:40,282 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:40,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,322 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:40,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:40,358 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:40,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:40,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,399 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:40:40,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:40,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:40,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:40,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,480 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:40,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-18 09:40:40,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:40,530 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:40,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-02-18 09:40:40,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,567 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:40,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-18 09:40:40,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:40,614 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:40,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-18 09:40:40,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:40,654 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:40,655 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:40,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:40,701 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:40,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:40:40,726 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:40:40,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:40,803 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:40:40,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:40,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-18 09:40:40,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:40,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:40:40,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:40:40,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:40:40,824 INFO L87 Difference]: Start difference. First operand 359 states and 1989 transitions. Second operand 13 states. [2019-02-18 09:40:42,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:42,491 INFO L93 Difference]: Finished difference Result 483 states and 2465 transitions. [2019-02-18 09:40:42,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:40:42,492 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-18 09:40:42,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:42,494 INFO L225 Difference]: With dead ends: 483 [2019-02-18 09:40:42,494 INFO L226 Difference]: Without dead ends: 482 [2019-02-18 09:40:42,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:40:42,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-02-18 09:40:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 378. [2019-02-18 09:40:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-02-18 09:40:43,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2103 transitions. [2019-02-18 09:40:43,165 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2103 transitions. Word has length 8 [2019-02-18 09:40:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:43,166 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2103 transitions. [2019-02-18 09:40:43,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:40:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2103 transitions. [2019-02-18 09:40:43,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:40:43,167 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:43,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:43,167 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:43,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:43,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1868963088, now seen corresponding path program 1 times [2019-02-18 09:40:43,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:43,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:43,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:40:43,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:43,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:43,276 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:40:43,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:43,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:43,276 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:40:43,276 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-02-18 09:40:43,277 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:43,277 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:43,279 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:43,279 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:40:43,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:43,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:43,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:43,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:43,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:43,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:43,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:43,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:40:43,301 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:43,307 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:43,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-18 09:40:43,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-18 09:40:43,333 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:43,347 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:43,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:43,499 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:43,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:43,524 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:43,525 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-18 09:40:43,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,556 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:40:43,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:43,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:43,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:22 [2019-02-18 09:40:43,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-02-18 09:40:43,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:43,609 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:43,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-02-18 09:40:43,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:43,633 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:43,634 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:40:43,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:43,655 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:43,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-18 09:40:43,672 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:40:43,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:43,708 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:40:43,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:43,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:40:43,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:43,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:40:43,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:40:43,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:40:43,729 INFO L87 Difference]: Start difference. First operand 378 states and 2103 transitions. Second operand 10 states. [2019-02-18 09:40:44,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:44,687 INFO L93 Difference]: Finished difference Result 400 states and 2126 transitions. [2019-02-18 09:40:44,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:40:44,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-18 09:40:44,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:44,688 INFO L225 Difference]: With dead ends: 400 [2019-02-18 09:40:44,688 INFO L226 Difference]: Without dead ends: 393 [2019-02-18 09:40:44,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:40:44,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-02-18 09:40:45,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 380. [2019-02-18 09:40:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-02-18 09:40:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 2097 transitions. [2019-02-18 09:40:45,360 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 2097 transitions. Word has length 8 [2019-02-18 09:40:45,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:45,360 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 2097 transitions. [2019-02-18 09:40:45,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:40:45,360 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 2097 transitions. [2019-02-18 09:40:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:40:45,361 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:45,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:45,361 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:45,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:45,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1473696100, now seen corresponding path program 1 times [2019-02-18 09:40:45,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:45,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:45,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:45,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:45,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:40:45,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:45,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:45,478 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:40:45,479 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-02-18 09:40:45,479 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:45,479 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:45,481 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:45,481 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:40:45,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:45,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:45,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:45,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:45,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:45,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:45,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:45,497 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:45,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:45,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,508 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:45,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,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, 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:45,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,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, 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:45,533 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:45,557 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:45,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:45,582 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:45,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:45,609 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:45,609 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:45,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,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, 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:45,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:45,682 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:45,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:45,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:40:45,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:45,760 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:45,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:45,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:45,798 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:45,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:40:45,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:45,846 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:45,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:45,866 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:40:45,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:45,900 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:40:45,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:45,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:40:45,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:45,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:40:45,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:40:45,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:40:45,918 INFO L87 Difference]: Start difference. First operand 380 states and 2097 transitions. Second operand 10 states. [2019-02-18 09:40:46,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:46,964 INFO L93 Difference]: Finished difference Result 409 states and 2136 transitions. [2019-02-18 09:40:46,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:40:46,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-18 09:40:46,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:46,966 INFO L225 Difference]: With dead ends: 409 [2019-02-18 09:40:46,966 INFO L226 Difference]: Without dead ends: 397 [2019-02-18 09:40:46,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:40:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-02-18 09:40:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 378. [2019-02-18 09:40:47,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-02-18 09:40:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2077 transitions. [2019-02-18 09:40:47,628 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2077 transitions. Word has length 8 [2019-02-18 09:40:47,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:47,628 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2077 transitions. [2019-02-18 09:40:47,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:40:47,629 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2077 transitions. [2019-02-18 09:40:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:40:47,629 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:47,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:47,629 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:47,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:47,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 3 times [2019-02-18 09:40:47,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:47,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:47,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:47,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:47,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:47,826 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-02-18 09:40:47,971 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:40:47,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:47,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:47,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:40:47,972 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:40:47,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:47,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:47,982 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:40:47,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:40:47,987 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:40:47,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:40:47,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:47,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:40:47,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:47,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, 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:47,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:47,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:47,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:40:48,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:40:48,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:48,013 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:48,038 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:48,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:48,063 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:48,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:48,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:48,090 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:48,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:40:48,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:48,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:48,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:48,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,214 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:40:48,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:48,259 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:48,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:48,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,300 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:48,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-18 09:40:48,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:48,349 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:48,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-02-18 09:40:48,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,394 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:48,395 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:48,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:48,439 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:48,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-18 09:40:48,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:48,480 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:48,481 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:48,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:48,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:48,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:40:48,553 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:40:48,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:48,636 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:40:48,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:48,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-18 09:40:48,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:48,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:40:48,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:40:48,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:40:48,656 INFO L87 Difference]: Start difference. First operand 378 states and 2077 transitions. Second operand 14 states. [2019-02-18 09:40:50,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:50,540 INFO L93 Difference]: Finished difference Result 542 states and 2749 transitions. [2019-02-18 09:40:50,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:40:50,540 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-18 09:40:50,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:50,543 INFO L225 Difference]: With dead ends: 542 [2019-02-18 09:40:50,543 INFO L226 Difference]: Without dead ends: 536 [2019-02-18 09:40:50,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2019-02-18 09:40:50,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-02-18 09:40:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 446. [2019-02-18 09:40:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-02-18 09:40:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 2483 transitions. [2019-02-18 09:40:51,399 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 2483 transitions. Word has length 8 [2019-02-18 09:40:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:51,399 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 2483 transitions. [2019-02-18 09:40:51,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:40:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 2483 transitions. [2019-02-18 09:40:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:40:51,400 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:51,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:51,400 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:51,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:51,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1468154974, now seen corresponding path program 1 times [2019-02-18 09:40:51,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:51,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:51,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:40:51,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:51,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:40:51,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:51,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:51,511 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:40:51,511 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-02-18 09:40:51,511 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:51,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:51,513 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:51,513 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:40:51,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:51,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:51,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:51,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:51,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:51,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:51,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:51,530 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,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,535 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:51,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,539 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:51,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,545 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:51,549 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,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,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, 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:51,554 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:51,582 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,595 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,606 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,615 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,633 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:51,633 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:51,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,669 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:51,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:51,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:40:51,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:51,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,747 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:40:51,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:51,792 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,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:51,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:51,829 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:51,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-02-18 09:40:51,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:51,881 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:51,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:51,906 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:40:51,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:51,935 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:40:51,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:51,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 09:40:51,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:51,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:40:51,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:40:51,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:40:51,955 INFO L87 Difference]: Start difference. First operand 446 states and 2483 transitions. Second operand 9 states. [2019-02-18 09:40:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:53,210 INFO L93 Difference]: Finished difference Result 469 states and 2511 transitions. [2019-02-18 09:40:53,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:40:53,210 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-18 09:40:53,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:53,212 INFO L225 Difference]: With dead ends: 469 [2019-02-18 09:40:53,213 INFO L226 Difference]: Without dead ends: 465 [2019-02-18 09:40:53,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 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:40:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-02-18 09:40:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 443. [2019-02-18 09:40:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-02-18 09:40:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 2463 transitions. [2019-02-18 09:40:54,111 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 2463 transitions. Word has length 8 [2019-02-18 09:40:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:54,112 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 2463 transitions. [2019-02-18 09:40:54,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:40:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 2463 transitions. [2019-02-18 09:40:54,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:40:54,113 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:54,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:54,113 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:54,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:54,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1587664806, now seen corresponding path program 4 times [2019-02-18 09:40:54,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:54,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:54,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:54,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:54,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:54,458 WARN L181 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-02-18 09:40:54,614 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:40:54,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:54,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:54,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:40:54,615 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:40:54,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:54,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:54,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:54,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:54,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:54,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:54,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,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, 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:54,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,643 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:54,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,648 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:54,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:54,656 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:54,683 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:54,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:54,708 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:54,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:54,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:54,735 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:54,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:40:54,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:54,812 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:54,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:54,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,861 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:54,861 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:54,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:54,904 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:54,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:38 [2019-02-18 09:40:54,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:54,965 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:54,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:55,008 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:55,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-02-18 09:40:55,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,049 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:55,050 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:55,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:55,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:55,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-18 09:40:55,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:55,145 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:55,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:55,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:55,190 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:55,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:40:55,217 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:40:55,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:55,320 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:40:55,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:55,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-18 09:40:55,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:55,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:40:55,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:40:55,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:40:55,339 INFO L87 Difference]: Start difference. First operand 443 states and 2463 transitions. Second operand 14 states. [2019-02-18 09:40:57,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:57,012 INFO L93 Difference]: Finished difference Result 481 states and 2515 transitions. [2019-02-18 09:40:57,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:40:57,013 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-18 09:40:57,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:57,016 INFO L225 Difference]: With dead ends: 481 [2019-02-18 09:40:57,016 INFO L226 Difference]: Without dead ends: 480 [2019-02-18 09:40:57,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:40:57,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-02-18 09:40:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 254. [2019-02-18 09:40:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-02-18 09:40:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 1362 transitions. [2019-02-18 09:40:57,521 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 1362 transitions. Word has length 8 [2019-02-18 09:40:57,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:57,521 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 1362 transitions. [2019-02-18 09:40:57,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:40:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 1362 transitions. [2019-02-18 09:40:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:40:57,522 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:57,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:57,522 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:57,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1706484960, now seen corresponding path program 1 times [2019-02-18 09:40:57,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:57,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:57,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:57,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:57,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:57,610 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:57,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:57,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:57,610 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:40:57,610 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [30], [31] [2019-02-18 09:40:57,611 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:57,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:57,614 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:57,614 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:40:57,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:57,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:57,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:57,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:57,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:57,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:57,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:57,632 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:57,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, 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:57,645 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:57,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:57,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-18 09:40:57,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:57,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:57,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-18 09:40:57,679 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:57,691 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:57,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:57,709 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:57,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:57,732 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:57,732 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-18 09:40:57,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:57,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:57,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:57,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:57,761 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:40:57,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:57,775 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:57,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:40:57,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:57,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:57,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:57,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:57,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:57,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:57,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:40:57,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:57,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:57,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-18 09:40:57,828 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:57,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:57,848 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:57,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:57,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:40:57,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:57,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:40:57,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:40:57,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:40:57,868 INFO L87 Difference]: Start difference. First operand 254 states and 1362 transitions. Second operand 8 states. [2019-02-18 09:40:58,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:58,534 INFO L93 Difference]: Finished difference Result 267 states and 1394 transitions. [2019-02-18 09:40:58,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:40:58,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-02-18 09:40:58,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:58,536 INFO L225 Difference]: With dead ends: 267 [2019-02-18 09:40:58,536 INFO L226 Difference]: Without dead ends: 258 [2019-02-18 09:40:58,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:40:58,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-02-18 09:40:59,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-02-18 09:40:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-02-18 09:40:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 1374 transitions. [2019-02-18 09:40:59,031 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 1374 transitions. Word has length 8 [2019-02-18 09:40:59,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:59,031 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 1374 transitions. [2019-02-18 09:40:59,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:40:59,031 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 1374 transitions. [2019-02-18 09:40:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:40:59,031 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:59,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:40:59,032 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:59,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:59,032 INFO L82 PathProgramCache]: Analyzing trace with hash -716062376, now seen corresponding path program 1 times [2019-02-18 09:40:59,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:59,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:59,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:59,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:59,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:59,211 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:59,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:59,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:59,212 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:40:59,212 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [27] [2019-02-18 09:40:59,213 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:59,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:59,215 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:59,215 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:40:59,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:59,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:59,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:59,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:59,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:59,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:59,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:59,231 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:59,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,234 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:59,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,240 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:59,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,248 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:59,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:59,254 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:59,282 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:59,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:59,307 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:59,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:59,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:59,333 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:40:59,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:59,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:59,409 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:59,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:59,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,447 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:40:59,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:59,489 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:59,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:40:59,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,530 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:59,531 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:40:59,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:59,574 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:59,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:40:59,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,614 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:59,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:59,616 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:40:59,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:59,664 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:59,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:40:59,692 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:59,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:59,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:40:59,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:59,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:40:59,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:59,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:40:59,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:40:59,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:40:59,781 INFO L87 Difference]: Start difference. First operand 257 states and 1374 transitions. Second operand 11 states. [2019-02-18 09:41:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:01,003 INFO L93 Difference]: Finished difference Result 309 states and 1505 transitions. [2019-02-18 09:41:01,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:41:01,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-18 09:41:01,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:01,006 INFO L225 Difference]: With dead ends: 309 [2019-02-18 09:41:01,006 INFO L226 Difference]: Without dead ends: 306 [2019-02-18 09:41:01,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:41:01,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-02-18 09:41:01,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 248. [2019-02-18 09:41:01,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-02-18 09:41:01,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1322 transitions. [2019-02-18 09:41:01,633 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1322 transitions. Word has length 8 [2019-02-18 09:41:01,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:01,633 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1322 transitions. [2019-02-18 09:41:01,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:41:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1322 transitions. [2019-02-18 09:41:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:41:01,634 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:01,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:01,634 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:01,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:01,634 INFO L82 PathProgramCache]: Analyzing trace with hash -698958370, now seen corresponding path program 1 times [2019-02-18 09:41:01,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:01,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:01,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:01,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:01,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:01,723 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:01,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:01,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:01,723 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:41:01,723 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [30], [31] [2019-02-18 09:41:01,724 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:01,724 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:01,726 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:01,726 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:41:01,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:01,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:01,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:01,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:01,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:01,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:01,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:01,748 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:01,754 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:01,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:41:01,772 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:41:01,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,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, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-18 09:41:01,784 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:01,795 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:01,804 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:01,813 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:01,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:01,834 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,834 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-02-18 09:41:01,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 21 [2019-02-18 09:41:01,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:01,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:01,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-02-18 09:41:01,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:01,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:41:01,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:01,886 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:41:01,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-02-18 09:41:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:01,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:01,912 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:41:01,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:01,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-18 09:41:01,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:01,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:41:01,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:41:01,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:41:01,931 INFO L87 Difference]: Start difference. First operand 248 states and 1322 transitions. Second operand 9 states. [2019-02-18 09:41:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:03,038 INFO L93 Difference]: Finished difference Result 379 states and 1929 transitions. [2019-02-18 09:41:03,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:41:03,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-18 09:41:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:03,040 INFO L225 Difference]: With dead ends: 379 [2019-02-18 09:41:03,041 INFO L226 Difference]: Without dead ends: 366 [2019-02-18 09:41:03,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:41:03,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-18 09:41:03,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 243. [2019-02-18 09:41:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-02-18 09:41:03,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 1245 transitions. [2019-02-18 09:41:03,742 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 1245 transitions. Word has length 8 [2019-02-18 09:41:03,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:03,742 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 1245 transitions. [2019-02-18 09:41:03,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:41:03,743 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 1245 transitions. [2019-02-18 09:41:03,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:41:03,743 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:03,743 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:03,743 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:03,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:03,743 INFO L82 PathProgramCache]: Analyzing trace with hash -712249128, now seen corresponding path program 1 times [2019-02-18 09:41:03,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:03,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:03,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:03,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:03,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:03,908 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 21 [2019-02-18 09:41:03,987 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:03,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:03,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:03,987 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:41:03,987 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [27] [2019-02-18 09:41:03,988 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:03,988 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:03,989 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:03,989 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:41:03,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:03,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:03,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:03,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:03,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:03,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:04,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:04,007 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:04,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:04,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:41:04,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:41:04,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,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, 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:41:04,032 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:04,051 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:04,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:04,127 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:04,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:04,150 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:41:04,150 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-18 09:41:04,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:04,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:04,216 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:41:04,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:41:04,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:41:04,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:04,276 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:04,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:41:04,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,303 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:04,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,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 33 treesize of output 72 [2019-02-18 09:41:04,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:04,337 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:04,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-18 09:41:04,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:04,368 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:04,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, 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:41:04,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:04,401 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:04,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:41:04,421 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:04,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:04,464 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:04,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:04,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:41:04,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:04,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:41:04,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:41:04,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:41:04,484 INFO L87 Difference]: Start difference. First operand 243 states and 1245 transitions. Second operand 12 states. [2019-02-18 09:41:06,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:06,142 INFO L93 Difference]: Finished difference Result 371 states and 1813 transitions. [2019-02-18 09:41:06,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:41:06,143 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-02-18 09:41:06,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:06,144 INFO L225 Difference]: With dead ends: 371 [2019-02-18 09:41:06,144 INFO L226 Difference]: Without dead ends: 366 [2019-02-18 09:41:06,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:41:06,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-18 09:41:07,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 248. [2019-02-18 09:41:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-02-18 09:41:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1279 transitions. [2019-02-18 09:41:07,010 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1279 transitions. Word has length 8 [2019-02-18 09:41:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:07,010 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1279 transitions. [2019-02-18 09:41:07,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:41:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1279 transitions. [2019-02-18 09:41:07,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:41:07,011 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:07,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:07,011 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:07,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:07,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1048410772, now seen corresponding path program 1 times [2019-02-18 09:41:07,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:07,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:07,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:07,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:07,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:07,129 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:07,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:07,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:07,129 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:41:07,130 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [27] [2019-02-18 09:41:07,130 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:07,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:07,132 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:07,132 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:41:07,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:07,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:07,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:07,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:07,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:07,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:07,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:07,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:41:07,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,155 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:41:07,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:41:07,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:41:07,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:07,181 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:07,208 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:07,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:07,232 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:07,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:07,259 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:41:07,259 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:41:07,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,295 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:07,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:07,337 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:07,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:07,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,373 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:07,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, 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:41:07,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:07,417 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:07,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:07,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,458 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:41:07,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:07,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:07,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:07,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:07,540 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:07,541 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:07,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:07,585 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:07,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:41:07,606 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:07,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:07,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:07,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:41:07,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:07,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:41:07,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:41:07,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:41:07,672 INFO L87 Difference]: Start difference. First operand 248 states and 1279 transitions. Second operand 11 states. [2019-02-18 09:41:09,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:09,146 INFO L93 Difference]: Finished difference Result 285 states and 1427 transitions. [2019-02-18 09:41:09,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:41:09,147 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-18 09:41:09,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:09,148 INFO L225 Difference]: With dead ends: 285 [2019-02-18 09:41:09,148 INFO L226 Difference]: Without dead ends: 284 [2019-02-18 09:41:09,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:41:09,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-02-18 09:41:10,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 253. [2019-02-18 09:41:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-02-18 09:41:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 1305 transitions. [2019-02-18 09:41:10,053 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 1305 transitions. Word has length 8 [2019-02-18 09:41:10,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:10,053 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 1305 transitions. [2019-02-18 09:41:10,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:41:10,053 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 1305 transitions. [2019-02-18 09:41:10,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:41:10,054 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:10,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:10,054 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:10,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:10,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1055499044, now seen corresponding path program 1 times [2019-02-18 09:41:10,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:10,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:10,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:10,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:10,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:10,170 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:10,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:10,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:10,170 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:41:10,170 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-02-18 09:41:10,171 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:10,171 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:10,172 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:10,172 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:41:10,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:10,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:10,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:10,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:10,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:10,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:10,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:10,192 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:10,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:41:10,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,209 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:41:10,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,217 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:41:10,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,225 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:10,226 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:10,252 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:10,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:10,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:10,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:10,304 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:41:10,304 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:41:10,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:41:10,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:10,383 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:10,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:10,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,424 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:10,424 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:41:10,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:10,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:10,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:10,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:10,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:10,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:10,548 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:10,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:10,572 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:10,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:10,607 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:10,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:10,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 09:41:10,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:10,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:41:10,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:41:10,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:41:10,627 INFO L87 Difference]: Start difference. First operand 253 states and 1305 transitions. Second operand 9 states. [2019-02-18 09:41:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:11,944 INFO L93 Difference]: Finished difference Result 281 states and 1396 transitions. [2019-02-18 09:41:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:41:11,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-18 09:41:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:11,946 INFO L225 Difference]: With dead ends: 281 [2019-02-18 09:41:11,946 INFO L226 Difference]: Without dead ends: 274 [2019-02-18 09:41:11,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:41:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-02-18 09:41:12,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2019-02-18 09:41:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-02-18 09:41:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 1366 transitions. [2019-02-18 09:41:12,943 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 1366 transitions. Word has length 8 [2019-02-18 09:41:12,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:12,943 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 1366 transitions. [2019-02-18 09:41:12,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:41:12,943 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 1366 transitions. [2019-02-18 09:41:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:41:12,944 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:12,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:12,944 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:12,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:12,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1051985692, now seen corresponding path program 2 times [2019-02-18 09:41:12,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:12,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:12,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:12,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:12,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:13,102 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:13,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:13,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:13,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:41:13,103 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:13,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:13,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:13,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:41:13,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:41:13,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:41:13,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:41:13,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:13,138 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:13,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,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:41:13,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,165 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:41:13,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,171 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:41:13,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:41:13,180 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:13,206 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,220 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,231 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,241 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,258 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:41:13,259 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:41:13,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:13,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:13,336 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,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:13,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,374 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:13,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, 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:41:13,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:13,415 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,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:13,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,456 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:13,457 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:41:13,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:13,500 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,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:13,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:13,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 36 treesize of output 78 [2019-02-18 09:41:13,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:13,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:13,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:13,607 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:13,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:13,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:13,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:41:13,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:13,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:41:13,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:41:13,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:41:13,687 INFO L87 Difference]: Start difference. First operand 264 states and 1366 transitions. Second operand 12 states. [2019-02-18 09:41:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:15,364 INFO L93 Difference]: Finished difference Result 295 states and 1460 transitions. [2019-02-18 09:41:15,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:41:15,364 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-02-18 09:41:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:15,366 INFO L225 Difference]: With dead ends: 295 [2019-02-18 09:41:15,366 INFO L226 Difference]: Without dead ends: 288 [2019-02-18 09:41:15,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-02-18 09:41:15,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-02-18 09:41:16,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 263. [2019-02-18 09:41:16,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-02-18 09:41:16,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1359 transitions. [2019-02-18 09:41:16,406 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1359 transitions. Word has length 8 [2019-02-18 09:41:16,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:16,406 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1359 transitions. [2019-02-18 09:41:16,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:41:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1359 transitions. [2019-02-18 09:41:16,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:41:16,407 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:16,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:16,407 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:16,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:16,408 INFO L82 PathProgramCache]: Analyzing trace with hash -937469088, now seen corresponding path program 2 times [2019-02-18 09:41:16,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:16,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:16,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:41:16,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:16,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:16,900 WARN L181 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-02-18 09:41:16,976 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:16,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:16,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:16,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:41:16,976 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:16,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:16,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:16,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:41:16,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:41:16,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:41:16,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:41:16,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:16,994 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:16,999 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:17,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:41:17,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,013 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:41:17,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,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:41:17,025 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:17,044 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:17,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:17,064 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:17,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:17,088 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:41:17,089 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-18 09:41:17,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:17,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:17,156 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:41:17,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:41:17,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,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, 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:41:17,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:17,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:17,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:41:17,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,252 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:17,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:17,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:17,285 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:17,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:41:17,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:17,319 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:17,319 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:41:17,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:17,351 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:17,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:41:17,372 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:17,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:17,425 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:41:17,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:17,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:41:17,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:17,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:41:17,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:41:17,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:41:17,445 INFO L87 Difference]: Start difference. First operand 263 states and 1359 transitions. Second operand 12 states. [2019-02-18 09:41:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:19,379 INFO L93 Difference]: Finished difference Result 370 states and 1786 transitions. [2019-02-18 09:41:19,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:41:19,380 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-02-18 09:41:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:19,381 INFO L225 Difference]: With dead ends: 370 [2019-02-18 09:41:19,381 INFO L226 Difference]: Without dead ends: 363 [2019-02-18 09:41:19,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:41:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-02-18 09:41:20,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 288. [2019-02-18 09:41:20,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-02-18 09:41:20,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 1503 transitions. [2019-02-18 09:41:20,522 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 1503 transitions. Word has length 8 [2019-02-18 09:41:20,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:20,523 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 1503 transitions. [2019-02-18 09:41:20,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:41:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 1503 transitions. [2019-02-18 09:41:20,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:41:20,523 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:20,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:20,524 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:20,524 INFO L82 PathProgramCache]: Analyzing trace with hash -819496728, now seen corresponding path program 3 times [2019-02-18 09:41:20,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:20,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:20,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:41:20,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:20,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:20,950 WARN L181 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2019-02-18 09:41:21,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:21,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:21,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:21,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:41:21,033 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:21,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:21,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:21,041 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:41:21,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:41:21,045 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:41:21,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:41:21,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:21,048 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:21,050 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:21,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:41:21,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,062 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:41:21,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,072 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:41:21,072 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:21,091 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:21,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:21,110 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:21,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:21,145 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:41:21,145 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-18 09:41:21,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:21,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:21,214 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:41:21,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:41:21,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,244 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:21,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, 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:21,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:21,273 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:41:21,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:41:21,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,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 31 treesize of output 57 [2019-02-18 09:41:21,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:21,334 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:21,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:41:21,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,364 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:21,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:21,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:41:21,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:21,398 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:21,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-18 09:41:21,417 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:21,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:21,470 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:41:21,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:21,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:41:21,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:21,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:41:21,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:41:21,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:41:21,489 INFO L87 Difference]: Start difference. First operand 288 states and 1503 transitions. Second operand 12 states. [2019-02-18 09:41:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:23,262 INFO L93 Difference]: Finished difference Result 349 states and 1691 transitions. [2019-02-18 09:41:23,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:41:23,262 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-02-18 09:41:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:23,263 INFO L225 Difference]: With dead ends: 349 [2019-02-18 09:41:23,263 INFO L226 Difference]: Without dead ends: 344 [2019-02-18 09:41:23,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:41:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-02-18 09:41:24,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 236. [2019-02-18 09:41:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-02-18 09:41:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1210 transitions. [2019-02-18 09:41:24,245 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1210 transitions. Word has length 8 [2019-02-18 09:41:24,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:24,245 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1210 transitions. [2019-02-18 09:41:24,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:41:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1210 transitions. [2019-02-18 09:41:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:41:24,246 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:24,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:24,246 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:24,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:24,246 INFO L82 PathProgramCache]: Analyzing trace with hash -826465836, now seen corresponding path program 1 times [2019-02-18 09:41:24,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:24,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:24,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:41:24,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:24,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:24,363 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,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:24,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:24,364 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:41:24,364 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-02-18 09:41:24,364 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:24,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:24,366 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:24,366 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:41:24,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:24,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:24,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:24,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:24,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:24,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:24,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:24,415 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,458 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,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:41:24,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,495 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:41:24,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,505 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:41:24,506 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:24,524 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,534 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,544 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,553 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,568 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:41:24,568 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-18 09:41:24,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:41:24,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:24,629 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:41:24,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:41:24,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,659 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:24,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:24,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:24,688 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:24,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:41:24,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:24,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:41:24,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:24,747 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:24,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:41:24,768 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:24,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:24,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:41:24,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:24,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 09:41:24,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:24,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:41:24,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:41:24,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:41:24,819 INFO L87 Difference]: Start difference. First operand 236 states and 1210 transitions. Second operand 9 states. [2019-02-18 09:41:26,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:26,224 INFO L93 Difference]: Finished difference Result 257 states and 1260 transitions. [2019-02-18 09:41:26,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:41:26,224 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-18 09:41:26,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:26,225 INFO L225 Difference]: With dead ends: 257 [2019-02-18 09:41:26,225 INFO L226 Difference]: Without dead ends: 250 [2019-02-18 09:41:26,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:41:26,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-18 09:41:27,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2019-02-18 09:41:27,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-02-18 09:41:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 1220 transitions. [2019-02-18 09:41:27,218 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 1220 transitions. Word has length 8 [2019-02-18 09:41:27,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:27,218 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 1220 transitions. [2019-02-18 09:41:27,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:41:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 1220 transitions. [2019-02-18 09:41:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:41:27,219 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:27,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:27,219 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:27,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:27,219 INFO L82 PathProgramCache]: Analyzing trace with hash -252398774, now seen corresponding path program 1 times [2019-02-18 09:41:27,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:27,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:27,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:27,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:27,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:27,347 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:27,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:27,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:27,347 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:41:27,347 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [27] [2019-02-18 09:41:27,348 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:27,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:27,349 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:27,349 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:41:27,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:27,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:27,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:27,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 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:27,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:27,360 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:27,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:27,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:41:27,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:41:27,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:41:27,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,400 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:41:27,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 09:41:27,408 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:27,435 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:27,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:27,460 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:27,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:27,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:27,487 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:41:27,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,523 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:27,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:27,561 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:27,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:27,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,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 36 treesize of output 78 [2019-02-18 09:41:27,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:27,645 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:27,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:27,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,683 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:27,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:41:27,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:27,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:27,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:41:27,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:27,781 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:27,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 106 [2019-02-18 09:41:27,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:27,831 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:27,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:41:27,854 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:27,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:27,915 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:27,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:27,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:41:27,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:27,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:41:27,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:41:27,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:41:27,933 INFO L87 Difference]: Start difference. First operand 238 states and 1220 transitions. Second operand 11 states. [2019-02-18 09:41:29,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:29,810 INFO L93 Difference]: Finished difference Result 316 states and 1514 transitions. [2019-02-18 09:41:29,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:41:29,811 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-18 09:41:29,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:29,812 INFO L225 Difference]: With dead ends: 316 [2019-02-18 09:41:29,812 INFO L226 Difference]: Without dead ends: 315 [2019-02-18 09:41:29,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:41:29,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-02-18 09:41:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 242. [2019-02-18 09:41:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-02-18 09:41:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1244 transitions. [2019-02-18 09:41:30,849 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1244 transitions. Word has length 8 [2019-02-18 09:41:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:30,849 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1244 transitions. [2019-02-18 09:41:30,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:41:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1244 transitions. [2019-02-18 09:41:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:41:30,850 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:30,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:30,850 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:30,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:30,850 INFO L82 PathProgramCache]: Analyzing trace with hash -191146492, now seen corresponding path program 1 times [2019-02-18 09:41:30,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:30,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:30,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:30,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:30,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:30,985 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:30,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:30,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:30,986 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:41:30,986 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-02-18 09:41:30,987 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:30,987 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:30,990 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:30,990 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:41:30,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:30,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:30,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:30,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:31,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:31,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:31,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:31,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:41:31,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,085 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:41:31,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,099 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:41:31,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,105 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:41:31,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:31,113 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:31,138 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:31,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:31,163 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:31,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:31,190 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:41:31,190 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:41:31,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,411 INFO L303 Elim1Store]: Index analysis took 202 ms [2019-02-18 09:41:31,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:31,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:31,451 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:31,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:31,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,487 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:31,488 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:41:31,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:31,529 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:31,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:31,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:31,562 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:31,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 09:41:31,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:31,605 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:31,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:31,630 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:31,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:31,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:41:31,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:31,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 09:41:31,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:31,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:41:31,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:41:31,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:41:31,683 INFO L87 Difference]: Start difference. First operand 242 states and 1244 transitions. Second operand 9 states. [2019-02-18 09:41:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:33,093 INFO L93 Difference]: Finished difference Result 253 states and 1273 transitions. [2019-02-18 09:41:33,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:41:33,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-18 09:41:33,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:33,095 INFO L225 Difference]: With dead ends: 253 [2019-02-18 09:41:33,095 INFO L226 Difference]: Without dead ends: 246 [2019-02-18 09:41:33,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:41:33,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-02-18 09:41:34,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2019-02-18 09:41:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-02-18 09:41:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 1234 transitions. [2019-02-18 09:41:34,128 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 1234 transitions. Word has length 8 [2019-02-18 09:41:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:34,128 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 1234 transitions. [2019-02-18 09:41:34,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:41:34,128 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 1234 transitions. [2019-02-18 09:41:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:41:34,129 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:34,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:34,129 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:34,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:34,129 INFO L82 PathProgramCache]: Analyzing trace with hash -477618734, now seen corresponding path program 2 times [2019-02-18 09:41:34,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:34,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:34,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:34,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:34,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:34,347 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:41:34,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:34,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:34,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:41:34,347 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:34,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:34,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:34,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:41:34,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:41:34,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:41:34,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:41:34,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:34,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 18 treesize of output 21 [2019-02-18 09:41:34,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,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, 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:41:34,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:41:34,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:41:34,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:34,392 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:34,419 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:34,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:34,444 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:34,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:34,471 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:41:34,471 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:41:34,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,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, 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:34,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:34,549 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:34,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:34,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,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, 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:34,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:34,638 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:34,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:34,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,681 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:34,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:34,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:34,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:34,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:41:34,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:34,768 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:34,768 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 99 [2019-02-18 09:41:34,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:34,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:34,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:41:34,845 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:34,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:34,914 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:41:34,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:34,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:41:34,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:34,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:41:34,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:41:34,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:41:34,934 INFO L87 Difference]: Start difference. First operand 240 states and 1234 transitions. Second operand 12 states. [2019-02-18 09:41:37,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:37,011 INFO L93 Difference]: Finished difference Result 332 states and 1585 transitions. [2019-02-18 09:41:37,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:41:37,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-02-18 09:41:37,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:37,013 INFO L225 Difference]: With dead ends: 332 [2019-02-18 09:41:37,013 INFO L226 Difference]: Without dead ends: 328 [2019-02-18 09:41:37,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-02-18 09:41:37,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-02-18 09:41:38,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 220. [2019-02-18 09:41:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-02-18 09:41:38,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 1124 transitions. [2019-02-18 09:41:38,011 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 1124 transitions. Word has length 8 [2019-02-18 09:41:38,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:38,011 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 1124 transitions. [2019-02-18 09:41:38,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:41:38,011 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 1124 transitions. [2019-02-18 09:41:38,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:41:38,011 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:38,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:38,012 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:38,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:38,012 INFO L82 PathProgramCache]: Analyzing trace with hash -366615482, now seen corresponding path program 1 times [2019-02-18 09:41:38,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:38,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:38,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:41:38,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:38,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:38,178 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:41:38,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:38,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:38,178 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:41:38,179 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-02-18 09:41:38,179 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:38,179 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:38,181 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:38,181 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:41:38,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:38,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:38,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:38,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:38,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:38,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:38,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:38,198 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:38,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,201 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:41:38,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:41:38,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,212 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:41:38,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,224 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,225 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:38,251 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:38,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:38,276 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:38,285 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,301 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:41:38,301 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:41:38,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:38,377 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,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:38,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,413 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:38,413 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:41:38,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:38,456 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,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:38,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:38,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, 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,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:38,539 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,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:38,565 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:38,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:38,599 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:38,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:38,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 09:41:38,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:38,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:41:38,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:41:38,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:41:38,617 INFO L87 Difference]: Start difference. First operand 220 states and 1124 transitions. Second operand 9 states. [2019-02-18 09:41:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:40,039 INFO L93 Difference]: Finished difference Result 242 states and 1184 transitions. [2019-02-18 09:41:40,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:41:40,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-18 09:41:40,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:40,041 INFO L225 Difference]: With dead ends: 242 [2019-02-18 09:41:40,041 INFO L226 Difference]: Without dead ends: 241 [2019-02-18 09:41:40,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:41:40,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-02-18 09:41:41,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-02-18 09:41:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-18 09:41:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1154 transitions. [2019-02-18 09:41:41,103 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1154 transitions. Word has length 8 [2019-02-18 09:41:41,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:41,103 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1154 transitions. [2019-02-18 09:41:41,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:41:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1154 transitions. [2019-02-18 09:41:41,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:41:41,104 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:41,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:41,104 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:41,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:41,104 INFO L82 PathProgramCache]: Analyzing trace with hash -987816240, now seen corresponding path program 1 times [2019-02-18 09:41:41,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:41,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:41,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:41,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:41,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:41,236 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:41,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:41,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:41,237 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:41:41,237 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-02-18 09:41:41,238 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:41,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:41,240 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:41,240 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:41:41,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:41,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:41,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:41,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:41,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:41,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:41,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:41,292 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:41,297 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:41,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:41:41,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,307 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:41:41,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 09:41:41,317 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:41,336 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:41,346 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:41,355 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:41,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:41,378 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:41,379 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:41:41,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:41:41,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:41,445 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:41,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:41:41,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,473 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:41,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-02-18 09:41:41,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:41,524 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:41,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:41:41,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:41,646 INFO L303 Elim1Store]: Index analysis took 103 ms [2019-02-18 09:41:41,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:41:41,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:41,673 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:41,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:41:41,695 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:41,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:41,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:41,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:41:41,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:41,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:41:41,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:41:41,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:41:41,748 INFO L87 Difference]: Start difference. First operand 225 states and 1154 transitions. Second operand 10 states. [2019-02-18 09:41:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:43,235 INFO L93 Difference]: Finished difference Result 254 states and 1190 transitions. [2019-02-18 09:41:43,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:41:43,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-18 09:41:43,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:43,237 INFO L225 Difference]: With dead ends: 254 [2019-02-18 09:41:43,237 INFO L226 Difference]: Without dead ends: 245 [2019-02-18 09:41:43,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:41:43,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-02-18 09:41:44,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 226. [2019-02-18 09:41:44,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-02-18 09:41:44,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1153 transitions. [2019-02-18 09:41:44,321 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1153 transitions. Word has length 8 [2019-02-18 09:41:44,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:44,321 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1153 transitions. [2019-02-18 09:41:44,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:41:44,321 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1153 transitions. [2019-02-18 09:41:44,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:41:44,322 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:44,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:44,322 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:44,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:44,322 INFO L82 PathProgramCache]: Analyzing trace with hash -993357366, now seen corresponding path program 1 times [2019-02-18 09:41:44,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:44,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:44,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:44,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:44,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:44,450 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:44,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:44,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:44,450 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:41:44,451 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [29] [2019-02-18 09:41:44,451 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:44,451 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:44,452 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:44,453 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:41:44,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:44,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:44,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:44,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:44,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:44,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:44,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:44,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:41:44,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:41:44,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:41:44,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:41:44,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,500 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:41:44,500 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:44,521 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:44,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:44,542 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:44,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:44,566 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:44,566 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:41:44,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:44,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:44,634 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:44,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:41:44,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,663 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:44,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:41:44,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:44,692 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:44,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:41:44,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:44,720 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 69 [2019-02-18 09:41:44,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:44,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:41:44,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:41:44,774 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:44,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:44,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:44,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:41:44,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:44,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:41:44,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:41:44,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:41:44,824 INFO L87 Difference]: Start difference. First operand 226 states and 1153 transitions. Second operand 10 states. [2019-02-18 09:41:46,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:46,258 INFO L93 Difference]: Finished difference Result 249 states and 1194 transitions. [2019-02-18 09:41:46,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:41:46,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-18 09:41:46,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:46,260 INFO L225 Difference]: With dead ends: 249 [2019-02-18 09:41:46,260 INFO L226 Difference]: Without dead ends: 248 [2019-02-18 09:41:46,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:41:46,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-02-18 09:41:47,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 229. [2019-02-18 09:41:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-02-18 09:41:47,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1171 transitions. [2019-02-18 09:41:47,375 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1171 transitions. Word has length 8 [2019-02-18 09:41:47,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:47,375 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1171 transitions. [2019-02-18 09:41:47,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:41:47,375 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1171 transitions. [2019-02-18 09:41:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:41:47,375 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:47,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:47,376 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:47,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:47,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1327610400, now seen corresponding path program 1 times [2019-02-18 09:41:47,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:47,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:47,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:47,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:47,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:47,451 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:47,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:47,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:47,451 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:41:47,451 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [30], [31] [2019-02-18 09:41:47,452 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:47,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:47,453 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:47,453 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:41:47,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:47,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:47,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:47,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 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:47,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:47,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:47,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:47,473 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:47,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,476 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:41:47,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,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, 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:41:47,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,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:41:47,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,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, 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:47,497 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:47,524 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:47,538 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:47,549 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:47,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:47,575 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:47,576 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-18 09:41:47,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,606 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:47,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:47,645 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:47,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:47,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:47,676 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:41:47,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:47,717 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:47,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:41:47,748 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:47,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:47,834 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:41:47,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:47,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-18 09:41:47,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:47,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:41:47,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:41:47,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:41:47,853 INFO L87 Difference]: Start difference. First operand 229 states and 1171 transitions. Second operand 7 states. [2019-02-18 09:41:49,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:49,167 INFO L93 Difference]: Finished difference Result 239 states and 1185 transitions. [2019-02-18 09:41:49,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:41:49,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-02-18 09:41:49,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:49,169 INFO L225 Difference]: With dead ends: 239 [2019-02-18 09:41:49,169 INFO L226 Difference]: Without dead ends: 230 [2019-02-18 09:41:49,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:41:49,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-02-18 09:41:50,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-02-18 09:41:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-02-18 09:41:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1158 transitions. [2019-02-18 09:41:50,271 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1158 transitions. Word has length 8 [2019-02-18 09:41:50,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:50,271 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1158 transitions. [2019-02-18 09:41:50,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:41:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1158 transitions. [2019-02-18 09:41:50,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:41:50,271 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:50,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:50,272 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:50,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:50,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-02-18 09:41:50,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:50,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:50,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:50,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:50,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:50,341 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:50,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:50,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:50,341 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:41:50,342 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [30], [31] [2019-02-18 09:41:50,342 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:50,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:50,343 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:50,343 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:41:50,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:50,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:50,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:50,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:50,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:50,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:50,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:50,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:50,366 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:50,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:41:50,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:41:50,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:41:50,397 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:50,414 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:50,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:50,434 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:50,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:50,458 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:50,459 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:41:50,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:50,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:50,520 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:50,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:41:50,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:50,548 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:41:50,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:50,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:50,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:41:50,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:50,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:50,611 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:41:50,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:50,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-18 09:41:50,630 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:50,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:41:50,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:41:50,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:41:50,631 INFO L87 Difference]: Start difference. First operand 227 states and 1158 transitions. Second operand 7 states. [2019-02-18 09:41:51,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:51,870 INFO L93 Difference]: Finished difference Result 236 states and 1166 transitions. [2019-02-18 09:41:51,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:41:51,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-02-18 09:41:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:51,872 INFO L225 Difference]: With dead ends: 236 [2019-02-18 09:41:51,872 INFO L226 Difference]: Without dead ends: 227 [2019-02-18 09:41:51,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:41:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-02-18 09:41:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-02-18 09:41:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-02-18 09:41:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1149 transitions. [2019-02-18 09:41:52,980 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1149 transitions. Word has length 8 [2019-02-18 09:41:52,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:52,980 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1149 transitions. [2019-02-18 09:41:52,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:41:52,980 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1149 transitions. [2019-02-18 09:41:52,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:41:52,980 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:52,980 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:52,980 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:52,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:52,981 INFO L82 PathProgramCache]: Analyzing trace with hash 213756976, now seen corresponding path program 1 times [2019-02-18 09:41:52,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:52,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:52,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:52,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:52,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:53,474 WARN L181 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-18 09:41:53,719 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 9 [2019-02-18 09:41:53,727 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:41:53,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:53,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:53,727 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:41:53,728 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [28], [30], [31] [2019-02-18 09:41:53,728 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:53,728 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:53,729 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:53,729 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:41:53,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:53,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:53,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:53,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:53,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:53,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:53,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:53,745 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:53,747 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:53,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:41:53,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:41:53,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,769 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:41:53,769 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:53,788 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:53,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:53,806 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:53,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:53,831 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:53,831 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:41:53,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:41:53,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:53,892 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:41:53,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:41:53,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,918 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 57 [2019-02-18 09:41:53,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:53,946 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:53,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-02-18 09:41:53,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:53,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, 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:41:53,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:54,004 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:54,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:41:54,027 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:54,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:54,056 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:54,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:54,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 09:41:54,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:54,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:41:54,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:41:54,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:41:54,075 INFO L87 Difference]: Start difference. First operand 226 states and 1149 transitions. Second operand 9 states. [2019-02-18 09:41:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:55,339 INFO L93 Difference]: Finished difference Result 236 states and 1163 transitions. [2019-02-18 09:41:55,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:41:55,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-18 09:41:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:55,341 INFO L225 Difference]: With dead ends: 236 [2019-02-18 09:41:55,341 INFO L226 Difference]: Without dead ends: 227 [2019-02-18 09:41:55,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:41:55,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-02-18 09:41:56,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-02-18 09:41:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-02-18 09:41:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 1137 transitions. [2019-02-18 09:41:56,431 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 1137 transitions. Word has length 9 [2019-02-18 09:41:56,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:56,432 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 1137 transitions. [2019-02-18 09:41:56,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:41:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 1137 transitions. [2019-02-18 09:41:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:41:56,432 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:56,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:41:56,433 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:56,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:56,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1864950956, now seen corresponding path program 1 times [2019-02-18 09:41:56,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:56,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:56,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:56,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:56,615 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:56,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:56,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:56,616 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:41:56,616 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-02-18 09:41:56,616 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:56,617 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:56,618 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:56,618 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:41:56,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:56,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:56,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:56,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:56,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:56,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:56,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:56,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:56,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:41:56,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:41:56,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,718 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:41:56,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:56,813 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:56,838 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:56,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:56,863 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:56,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:56,890 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:41:56,890 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:41:56,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 09:41:56,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:56,964 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:41:56,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:41:56,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:56,999 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:41:57,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:57,041 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:57,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-18 09:41:57,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,077 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:57,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 94 [2019-02-18 09:41:57,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:57,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:41:57,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:41:57,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:57,163 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:57,163 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:57,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:57,211 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:57,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:41:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:57,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:57,291 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:41:57,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:57,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-18 09:41:57,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:57,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:41:57,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:41:57,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:41:57,310 INFO L87 Difference]: Start difference. First operand 224 states and 1137 transitions. Second operand 11 states. [2019-02-18 09:41:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:59,389 INFO L93 Difference]: Finished difference Result 326 states and 1545 transitions. [2019-02-18 09:41:59,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:41:59,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-18 09:41:59,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:59,391 INFO L225 Difference]: With dead ends: 326 [2019-02-18 09:41:59,391 INFO L226 Difference]: Without dead ends: 316 [2019-02-18 09:41:59,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:41:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-02-18 09:42:00,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 197. [2019-02-18 09:42:00,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-18 09:42:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 997 transitions. [2019-02-18 09:42:00,541 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 997 transitions. Word has length 9 [2019-02-18 09:42:00,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:00,541 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 997 transitions. [2019-02-18 09:42:00,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:42:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 997 transitions. [2019-02-18 09:42:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:42:00,542 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:00,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:00,542 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:00,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:00,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1989953630, now seen corresponding path program 1 times [2019-02-18 09:42:00,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:00,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:00,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:00,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:00,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:00,653 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:00,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:00,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:00,654 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:42:00,654 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-02-18 09:42:00,654 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:42:00,654 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:42:00,656 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:42:00,657 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:42:00,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:00,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:42:00,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:00,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:00,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:00,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:42:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:00,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:00,676 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:00,678 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:00,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:42:00,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,698 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:42:00,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,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, 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:00,715 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:00,732 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:00,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:00,752 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:00,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:00,777 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:00,777 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:42:00,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:42:00,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:00,839 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:00,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:42:00,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,862 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:00,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:42:00,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:00,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:42:00,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-18 09:42:00,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:00,921 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:42:00,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:00,950 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:00,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:42:00,967 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:00,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:00,991 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:01,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:01,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:42:01,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:01,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:42:01,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:42:01,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:42:01,010 INFO L87 Difference]: Start difference. First operand 197 states and 997 transitions. Second operand 10 states. [2019-02-18 09:42:02,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:02,914 INFO L93 Difference]: Finished difference Result 288 states and 1415 transitions. [2019-02-18 09:42:02,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:42:02,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-18 09:42:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:02,916 INFO L225 Difference]: With dead ends: 288 [2019-02-18 09:42:02,916 INFO L226 Difference]: Without dead ends: 279 [2019-02-18 09:42:02,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:42:02,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-02-18 09:42:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2019-02-18 09:42:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-02-18 09:42:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1349 transitions. [2019-02-18 09:42:04,480 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1349 transitions. Word has length 9 [2019-02-18 09:42:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:04,480 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1349 transitions. [2019-02-18 09:42:04,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:42:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1349 transitions. [2019-02-18 09:42:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:42:04,481 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:04,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:04,481 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:04,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:04,482 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-02-18 09:42:04,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:04,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:04,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:04,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:04,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:04,629 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:42:04,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:04,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:04,630 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:42:04,630 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-02-18 09:42:04,631 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:42:04,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:42:04,633 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:42:04,633 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:42:04,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:04,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:42:04,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:04,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:04,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:04,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:42:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:04,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:04,650 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:04,656 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:04,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:42:04,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,667 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:42:04,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,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, 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:04,677 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:04,696 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:04,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:04,722 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:04,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:04,745 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,746 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-18 09:42:04,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:42:04,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:04,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:04,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:42:04,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,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, 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,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:04,864 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,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:42:04,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,892 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:04,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:04,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, 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:42:04,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:04,923 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,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-18 09:42:04,946 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,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:04,981 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,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:04,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 09:42:04,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:05,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:42:05,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:42:05,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:42:05,000 INFO L87 Difference]: Start difference. First operand 263 states and 1349 transitions. Second operand 9 states. [2019-02-18 09:42:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:06,934 INFO L93 Difference]: Finished difference Result 277 states and 1384 transitions. [2019-02-18 09:42:06,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:42:06,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-18 09:42:06,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:06,936 INFO L225 Difference]: With dead ends: 277 [2019-02-18 09:42:06,937 INFO L226 Difference]: Without dead ends: 268 [2019-02-18 09:42:06,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:42:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-02-18 09:42:08,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2019-02-18 09:42:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-02-18 09:42:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 1361 transitions. [2019-02-18 09:42:08,582 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 1361 transitions. Word has length 9 [2019-02-18 09:42:08,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:08,582 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 1361 transitions. [2019-02-18 09:42:08,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:42:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 1361 transitions. [2019-02-18 09:42:08,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:42:08,583 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:08,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:08,583 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:08,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:08,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1855010516, now seen corresponding path program 1 times [2019-02-18 09:42:08,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:08,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:08,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:08,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:08,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:08,774 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:42:08,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:08,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:08,775 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:42:08,775 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [27] [2019-02-18 09:42:08,775 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:42:08,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:42:08,776 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:42:08,777 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 09:42:08,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:08,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:42:08,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:08,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:08,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:08,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:42:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:08,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:08,793 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:08,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,795 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:42:08,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,801 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:42:08,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:08,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:42:08,814 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:08,840 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:08,854 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:08,865 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:08,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:08,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:08,892 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:42:08,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:42:08,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:08,968 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:08,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:08,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:08,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,008 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:09,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:42:09,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:09,051 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:09,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:09,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:42:09,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:09,134 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:09,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:09,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,176 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:09,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:42:09,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:09,224 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:42:09,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:42:09,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:09,266 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:09,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:42:09,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:09,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:09,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:42:09,338 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:42:09,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:09,413 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:42:09,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:09,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-18 09:42:09,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:09,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:42:09,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:42:09,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:42:09,432 INFO L87 Difference]: Start difference. First operand 266 states and 1361 transitions. Second operand 13 states. [2019-02-18 09:42:12,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:12,333 INFO L93 Difference]: Finished difference Result 361 states and 1740 transitions. [2019-02-18 09:42:12,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:42:12,334 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-18 09:42:12,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:12,335 INFO L225 Difference]: With dead ends: 361 [2019-02-18 09:42:12,335 INFO L226 Difference]: Without dead ends: 356 [2019-02-18 09:42:12,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:42:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-02-18 09:42:14,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 282. [2019-02-18 09:42:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-02-18 09:42:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 1454 transitions. [2019-02-18 09:42:14,070 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 1454 transitions. Word has length 9 [2019-02-18 09:42:14,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:14,070 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 1454 transitions. [2019-02-18 09:42:14,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:42:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 1454 transitions. [2019-02-18 09:42:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:42:14,071 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:14,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:14,071 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:14,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:14,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1858585436, now seen corresponding path program 2 times [2019-02-18 09:42:14,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:14,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:14,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:14,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:14,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:14,271 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-18 09:42:14,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:14,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:14,272 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:42:14,272 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:14,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:14,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 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:14,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:42:14,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:42:14,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-18 09:42:14,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:42:14,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:14,293 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:14,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,298 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:42:14,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,304 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:42:14,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,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, 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:14,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,319 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:42:14,320 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:14,345 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:14,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:14,370 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:14,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:14,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:14,397 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:42:14,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:14,431 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:42:14,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:14,932 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:14,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:15,263 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-02-18 09:42:15,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,572 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:15,572 INFO L303 Elim1Store]: Index analysis took 305 ms [2019-02-18 09:42:15,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:42:15,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:15,933 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:15,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:15,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:15,975 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:42:15,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:16,018 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:16,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:16,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,058 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:16,059 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:42:16,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:16,106 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:16,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:42:16,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,135 INFO L701 Elim1Store]: detected not equals via solver [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 L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,141 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:16,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:16,143 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:42:16,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:16,250 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:42:16,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:42:16,275 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:42:16,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:42:16,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:16,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-18 09:42:16,368 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:16,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:42:16,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:42:16,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:42:16,369 INFO L87 Difference]: Start difference. First operand 282 states and 1454 transitions. Second operand 13 states. [2019-02-18 09:42:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:19,162 INFO L93 Difference]: Finished difference Result 357 states and 1714 transitions. [2019-02-18 09:42:19,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:42:19,162 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-18 09:42:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:19,163 INFO L225 Difference]: With dead ends: 357 [2019-02-18 09:42:19,164 INFO L226 Difference]: Without dead ends: 352 [2019-02-18 09:42:19,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:42:19,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-02-18 09:42:20,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 236. [2019-02-18 09:42:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-02-18 09:42:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1192 transitions. [2019-02-18 09:42:20,670 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1192 transitions. Word has length 9 [2019-02-18 09:42:20,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:20,670 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1192 transitions. [2019-02-18 09:42:20,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:42:20,671 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1192 transitions. [2019-02-18 09:42:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:42:20,671 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:20,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:20,671 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:20,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:20,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1629790556, now seen corresponding path program 3 times [2019-02-18 09:42:20,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:20,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:20,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:42:20,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:20,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:20,910 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:42:20,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:20,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:20,910 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:42:20,911 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:20,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:20,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:20,942 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:42:20,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:42:20,958 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:42:20,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:42:20,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:20,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:42:20,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:20,971 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:42:20,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:20,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:20,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 23 treesize of output 37 [2019-02-18 09:42:20,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:20,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:20,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:20,981 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:20,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:20,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:20,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:20,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:20,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:42:20,988 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:21,015 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:21,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:21,040 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:21,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:21,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:21,067 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:42:21,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,104 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:42:21,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:21,143 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:21,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:21,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,179 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:21,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, 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:42:21,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:21,222 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:21,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:21,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:42:21,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:21,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:42:21,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:21,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,352 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:21,353 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:42:21,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:21,399 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:21,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:42:21,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:21,443 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:21,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 99 [2019-02-18 09:42:21,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:21,489 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:42:21,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:42:21,516 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:42:21,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:42:21,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:21,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-18 09:42:21,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:21,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:42:21,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:42:21,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:42:21,620 INFO L87 Difference]: Start difference. First operand 236 states and 1192 transitions. Second operand 14 states. [2019-02-18 09:42:23,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:23,870 INFO L93 Difference]: Finished difference Result 260 states and 1232 transitions. [2019-02-18 09:42:23,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:42:23,871 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2019-02-18 09:42:23,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:23,872 INFO L225 Difference]: With dead ends: 260 [2019-02-18 09:42:23,872 INFO L226 Difference]: Without dead ends: 253 [2019-02-18 09:42:23,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2019-02-18 09:42:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-02-18 09:42:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 152. [2019-02-18 09:42:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-02-18 09:42:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 750 transitions. [2019-02-18 09:42:24,903 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 750 transitions. Word has length 9 [2019-02-18 09:42:24,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:24,903 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 750 transitions. [2019-02-18 09:42:24,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:42:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 750 transitions. [2019-02-18 09:42:24,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:42:24,903 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:24,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:24,903 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:24,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:24,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1114051924, now seen corresponding path program 1 times [2019-02-18 09:42:24,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:24,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:24,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:42:24,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:24,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:25,062 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-02-18 09:42:25,145 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:25,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:25,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:25,146 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:42:25,146 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [29] [2019-02-18 09:42:25,147 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:42:25,147 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:42:25,148 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:42:25,148 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:42:25,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:25,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:42:25,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:25,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:25,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:25,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:42:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:25,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:25,186 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:25,188 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:25,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:42:25,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,202 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:42:25,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,212 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:25,212 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:25,231 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:25,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:25,251 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:25,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:25,275 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:25,276 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-18 09:42:25,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:25,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:25,345 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:25,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:42:25,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:42:25,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:25,410 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:25,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:42:25,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,444 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:25,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:25,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:25,477 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:25,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:42:25,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:25,509 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:25,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:42:25,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:25,542 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:25,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:42:25,566 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:25,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:25,616 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:42:25,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:25,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:42:25,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:25,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:42:25,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:42:25,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:42:25,634 INFO L87 Difference]: Start difference. First operand 152 states and 750 transitions. Second operand 12 states. [2019-02-18 09:42:27,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:27,444 INFO L93 Difference]: Finished difference Result 202 states and 935 transitions. [2019-02-18 09:42:27,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:42:27,445 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-18 09:42:27,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:27,446 INFO L225 Difference]: With dead ends: 202 [2019-02-18 09:42:27,446 INFO L226 Difference]: Without dead ends: 195 [2019-02-18 09:42:27,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:42:27,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-02-18 09:42:28,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2019-02-18 09:42:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-02-18 09:42:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 861 transitions. [2019-02-18 09:42:28,678 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 861 transitions. Word has length 9 [2019-02-18 09:42:28,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:28,678 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 861 transitions. [2019-02-18 09:42:28,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:42:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 861 transitions. [2019-02-18 09:42:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:42:28,679 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:28,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:28,679 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:28,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:28,679 INFO L82 PathProgramCache]: Analyzing trace with hash 770502112, now seen corresponding path program 1 times [2019-02-18 09:42:28,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:28,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:28,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:28,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:28,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:28,879 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:42:28,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:28,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:28,879 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:42:28,879 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-02-18 09:42:28,883 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:42:28,883 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:42:28,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:42:28,884 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:42:28,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:28,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:42:28,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:28,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:28,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:28,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:42:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:28,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:28,905 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:28,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:28,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:42:28,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:28,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:28,972 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:42:29,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,054 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:29,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,154 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:42:29,154 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:29,182 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:29,196 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:29,207 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:29,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:29,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:29,234 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:42:29,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,270 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:42:29,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:29,309 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:29,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:29,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,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, 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:42:29,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:29,406 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:29,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:29,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,443 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:29,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:42:29,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:29,492 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:29,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:42:29,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:29,530 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:29,531 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:42:29,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:29,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:42:29,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:42:29,605 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:29,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:29,668 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:42:29,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:29,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:42:29,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:29,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:42:29,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:42:29,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:42:29,686 INFO L87 Difference]: Start difference. First operand 173 states and 861 transitions. Second operand 11 states. [2019-02-18 09:42:31,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:31,549 INFO L93 Difference]: Finished difference Result 199 states and 939 transitions. [2019-02-18 09:42:31,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:42:31,549 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-18 09:42:31,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:31,550 INFO L225 Difference]: With dead ends: 199 [2019-02-18 09:42:31,550 INFO L226 Difference]: Without dead ends: 192 [2019-02-18 09:42:31,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:42:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-02-18 09:42:32,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2019-02-18 09:42:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-02-18 09:42:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 801 transitions. [2019-02-18 09:42:32,727 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 801 transitions. Word has length 9 [2019-02-18 09:42:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:32,727 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 801 transitions. [2019-02-18 09:42:32,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:42:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 801 transitions. [2019-02-18 09:42:32,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:42:32,728 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:32,728 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:32,728 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:32,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:32,728 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-02-18 09:42:32,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:32,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:32,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:32,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:32,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:32,795 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:32,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:32,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:32,795 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:42:32,796 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-02-18 09:42:32,796 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:42:32,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:42:32,798 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:42:32,798 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:42:32,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:32,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:42:32,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:32,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:32,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:32,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:42:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:32,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:32,814 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:32,818 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:32,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:42:32,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,843 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:42:32,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:32,859 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:32,877 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:32,888 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,897 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,907 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,922 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:32,922 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-18 09:42:32,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:42:32,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:32,980 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:32,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:42:32,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:32,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:42:33,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:33,034 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:33,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:42:33,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:33,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:42:33,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:33,097 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:33,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-18 09:42:33,115 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:33,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:33,140 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:33,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:33,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 09:42:33,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:33,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:42:33,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:42:33,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:42:33,159 INFO L87 Difference]: Start difference. First operand 162 states and 801 transitions. Second operand 9 states. [2019-02-18 09:42:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:34,749 INFO L93 Difference]: Finished difference Result 196 states and 942 transitions. [2019-02-18 09:42:34,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:42:34,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-18 09:42:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:34,750 INFO L225 Difference]: With dead ends: 196 [2019-02-18 09:42:34,751 INFO L226 Difference]: Without dead ends: 187 [2019-02-18 09:42:34,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:42:34,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-18 09:42:36,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-02-18 09:42:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-02-18 09:42:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 917 transitions. [2019-02-18 09:42:36,145 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 917 transitions. Word has length 9 [2019-02-18 09:42:36,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:36,145 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 917 transitions. [2019-02-18 09:42:36,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:42:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 917 transitions. [2019-02-18 09:42:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:42:36,146 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:36,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:36,146 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:36,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:36,146 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-02-18 09:42:36,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:36,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:36,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:36,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:36,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:36,258 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:42:36,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:36,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:36,258 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:42:36,259 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-02-18 09:42:36,259 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:42:36,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:42:36,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:42:36,260 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:42:36,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:36,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:42:36,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:36,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:36,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:36,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:42:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:36,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:36,275 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:36,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,279 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:42:36,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,284 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:42:36,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:36,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,295 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:42:36,295 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:36,322 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:36,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:36,347 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:36,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:36,374 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:36,374 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:42:36,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,408 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:42:36,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:36,449 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:36,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:36,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,492 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:42:36,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:36,537 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:36,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:36,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,573 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:36,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:36,574 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:42:36,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:36,622 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:42:36,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-18 09:42:36,661 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:36,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:36,692 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:36,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:36,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-02-18 09:42:36,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:36,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:42:36,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:42:36,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:42:36,711 INFO L87 Difference]: Start difference. First operand 186 states and 917 transitions. Second operand 8 states. [2019-02-18 09:42:37,245 WARN L181 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-02-18 09:42:38,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:38,865 INFO L93 Difference]: Finished difference Result 203 states and 968 transitions. [2019-02-18 09:42:38,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:42:38,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-02-18 09:42:38,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:38,866 INFO L225 Difference]: With dead ends: 203 [2019-02-18 09:42:38,866 INFO L226 Difference]: Without dead ends: 194 [2019-02-18 09:42:38,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:42:38,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-02-18 09:42:40,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 189. [2019-02-18 09:42:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-18 09:42:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 932 transitions. [2019-02-18 09:42:40,309 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 932 transitions. Word has length 9 [2019-02-18 09:42:40,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:40,309 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 932 transitions. [2019-02-18 09:42:40,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:42:40,309 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 932 transitions. [2019-02-18 09:42:40,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:42:40,309 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:40,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:40,309 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:40,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:40,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1804915160, now seen corresponding path program 1 times [2019-02-18 09:42:40,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:40,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:40,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:40,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:40,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:40,440 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:40,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:40,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:40,441 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:42:40,441 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-02-18 09:42:40,441 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:42:40,441 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:42:40,443 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:42:40,443 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:42:40,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:40,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:42:40,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:40,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:40,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:40,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:42:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:40,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:40,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:42:40,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:42:40,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:42:40,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,477 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:40,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,484 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:42:40,485 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:40,511 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:40,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:40,536 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:40,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:40,563 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:40,563 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:42:40,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:42:40,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:40,645 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:40,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:40,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:42:40,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:40,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:42:40,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:40,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,772 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:40,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 99 [2019-02-18 09:42:40,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:40,821 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:40,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:42:40,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:40,857 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:40,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-18 09:42:40,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:40,906 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:42:40,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:42:40,928 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:40,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:40,974 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:42:40,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:40,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:42:40,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:40,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:42:40,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:42:40,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:42:40,993 INFO L87 Difference]: Start difference. First operand 189 states and 932 transitions. Second operand 11 states. [2019-02-18 09:42:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:43,519 INFO L93 Difference]: Finished difference Result 269 states and 1267 transitions. [2019-02-18 09:42:43,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:42:43,520 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-18 09:42:43,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:43,521 INFO L225 Difference]: With dead ends: 269 [2019-02-18 09:42:43,521 INFO L226 Difference]: Without dead ends: 265 [2019-02-18 09:42:43,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:42:43,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-02-18 09:42:45,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 212. [2019-02-18 09:42:45,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-02-18 09:42:45,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1052 transitions. [2019-02-18 09:42:45,348 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1052 transitions. Word has length 9 [2019-02-18 09:42:45,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:45,348 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1052 transitions. [2019-02-18 09:42:45,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:42:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1052 transitions. [2019-02-18 09:42:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:42:45,348 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:45,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:45,349 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:45,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:45,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1810456286, now seen corresponding path program 1 times [2019-02-18 09:42:45,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:45,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:45,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:45,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:45,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:45,482 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:45,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:45,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:45,482 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:42:45,482 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [29] [2019-02-18 09:42:45,483 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:42:45,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:42:45,484 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:42:45,484 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:42:45,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:45,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:42:45,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:45,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:45,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:45,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:42:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:45,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:45,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:42:45,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:42:45,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,510 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:42:45,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,516 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:45,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,524 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:42:45,524 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:45,551 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,569 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,577 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,587 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,604 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:45,604 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:42:45,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,636 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,638 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 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:42:45,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:45,679 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:45,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:45,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,719 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:42:45,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:45,764 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,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:45,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,805 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:45,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 99 [2019-02-18 09:42:45,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:45,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:45,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:42:45,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:45,894 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:45,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 106 [2019-02-18 09:42:45,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:45,945 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:42:45,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:42:45,971 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:45,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:46,017 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:42:46,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:46,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:42:46,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:46,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:42:46,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:42:46,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:42:46,036 INFO L87 Difference]: Start difference. First operand 212 states and 1052 transitions. Second operand 11 states. [2019-02-18 09:42:48,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:48,572 INFO L93 Difference]: Finished difference Result 253 states and 1178 transitions. [2019-02-18 09:42:48,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:42:48,572 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-18 09:42:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:48,574 INFO L225 Difference]: With dead ends: 253 [2019-02-18 09:42:48,574 INFO L226 Difference]: Without dead ends: 249 [2019-02-18 09:42:48,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:42:48,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-02-18 09:42:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2019-02-18 09:42:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-02-18 09:42:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1063 transitions. [2019-02-18 09:42:50,403 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1063 transitions. Word has length 9 [2019-02-18 09:42:50,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:50,403 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1063 transitions. [2019-02-18 09:42:50,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:42:50,403 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1063 transitions. [2019-02-18 09:42:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:42:50,404 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:50,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:50,404 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:50,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:50,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1915676112, now seen corresponding path program 1 times [2019-02-18 09:42:50,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:50,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:50,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:50,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:50,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:50,501 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:42:50,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:50,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:50,501 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:42:50,501 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [30], [31] [2019-02-18 09:42:50,502 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:42:50,502 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:42:50,503 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:42:50,503 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:42:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:50,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:42:50,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:50,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:50,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:50,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:42:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:50,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:50,527 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:50,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:42:50,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:42:50,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 09:42:50,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,548 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:42:50,549 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:50,574 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:50,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:50,599 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:50,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:50,626 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:50,626 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:42:50,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,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 72 [2019-02-18 09:42:50,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:50,697 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:50,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:50,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,732 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:42:50,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:50,777 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:50,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:50,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:50,810 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:50,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:42:50,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:50,857 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:42:50,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-18 09:42:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:42:50,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:50,932 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:50,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:50,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-02-18 09:42:50,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:50,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:42:50,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:42:50,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:42:50,950 INFO L87 Difference]: Start difference. First operand 214 states and 1063 transitions. Second operand 8 states. [2019-02-18 09:42:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:53,067 INFO L93 Difference]: Finished difference Result 226 states and 1087 transitions. [2019-02-18 09:42:53,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:42:53,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-02-18 09:42:53,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:53,069 INFO L225 Difference]: With dead ends: 226 [2019-02-18 09:42:53,069 INFO L226 Difference]: Without dead ends: 217 [2019-02-18 09:42:53,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:42:53,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-02-18 09:42:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2019-02-18 09:42:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-02-18 09:42:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1059 transitions. [2019-02-18 09:42:54,898 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1059 transitions. Word has length 9 [2019-02-18 09:42:54,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:54,898 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1059 transitions. [2019-02-18 09:42:54,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:42:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1059 transitions. [2019-02-18 09:42:54,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:42:54,899 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:54,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:42:54,899 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:54,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:54,900 INFO L82 PathProgramCache]: Analyzing trace with hash -574217252, now seen corresponding path program 2 times [2019-02-18 09:42:54,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:54,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:54,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:54,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:54,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:55,162 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-18 09:42:55,272 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:42:55,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:55,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:55,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:42:55,273 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:55,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:55,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:55,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:42:55,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:42:55,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:42:55,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:42:55,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:55,292 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:55,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,296 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:42:55,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:42:55,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,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, 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:55,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,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, 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:42:55,314 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:55,341 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:55,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:55,366 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:55,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:55,393 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:55,393 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:42:55,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:42:55,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:55,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:42:55,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:42:55,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,503 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:55,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-02-18 09:42:55,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:55,545 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:55,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-18 09:42:55,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,582 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:42:55,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:55,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:55,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-18 09:42:55,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:55,666 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:42:55,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:42:55,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:55,714 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:42:55,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:42:55,742 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:55,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:55,814 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:42:55,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:55,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:42:55,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:55,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:42:55,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:42:55,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:42:55,833 INFO L87 Difference]: Start difference. First operand 214 states and 1059 transitions. Second operand 12 states. [2019-02-18 09:42:58,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:58,467 INFO L93 Difference]: Finished difference Result 258 states and 1213 transitions. [2019-02-18 09:42:58,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:42:58,468 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-18 09:42:58,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:58,468 INFO L225 Difference]: With dead ends: 258 [2019-02-18 09:42:58,469 INFO L226 Difference]: Without dead ends: 251 [2019-02-18 09:42:58,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-02-18 09:42:58,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-02-18 09:43:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 210. [2019-02-18 09:43:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-02-18 09:43:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 1036 transitions. [2019-02-18 09:43:00,301 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 1036 transitions. Word has length 9 [2019-02-18 09:43:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:43:00,301 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 1036 transitions. [2019-02-18 09:43:00,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:43:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 1036 transitions. [2019-02-18 09:43:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:43:00,302 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:43:00,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:43:00,302 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:43:00,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:43:00,302 INFO L82 PathProgramCache]: Analyzing trace with hash -566829084, now seen corresponding path program 2 times [2019-02-18 09:43:00,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:43:00,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:00,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:43:00,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:00,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:43:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:43:00,485 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:43:00,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:00,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:43:00,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:43:00,486 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:00,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:00,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:43:00,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:43:00,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:43:00,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:43:00,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:43:00,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:43:00,502 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:43:00,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 09:43:00,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:43:00,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,521 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:43:00,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,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, 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:43:00,530 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:00,549 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:00,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:00,569 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:00,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:00,594 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:00,594 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-18 09:43:00,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:43:00,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:00,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:00,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:43:00,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,697 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:00,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:43:00,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:00,723 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:00,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-02-18 09:43:00,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-18 09:43:00,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:00,785 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:00,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-02-18 09:43:00,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:00,817 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:00,818 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:43:00,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:00,848 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:00,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:43:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:43:00,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:43:00,922 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:43:00,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:43:00,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:43:00,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:43:00,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:43:00,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:43:00,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:43:00,942 INFO L87 Difference]: Start difference. First operand 210 states and 1036 transitions. Second operand 12 states. [2019-02-18 09:43:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:43:03,805 INFO L93 Difference]: Finished difference Result 279 states and 1323 transitions. [2019-02-18 09:43:03,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:43:03,805 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-18 09:43:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:43:03,806 INFO L225 Difference]: With dead ends: 279 [2019-02-18 09:43:03,806 INFO L226 Difference]: Without dead ends: 272 [2019-02-18 09:43:03,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:43:03,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-02-18 09:43:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 229. [2019-02-18 09:43:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-02-18 09:43:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1136 transitions. [2019-02-18 09:43:05,847 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1136 transitions. Word has length 9 [2019-02-18 09:43:05,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:43:05,847 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1136 transitions. [2019-02-18 09:43:05,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:43:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1136 transitions. [2019-02-18 09:43:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:43:05,847 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:43:05,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:43:05,848 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:43:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:43:05,848 INFO L82 PathProgramCache]: Analyzing trace with hash -967637198, now seen corresponding path program 2 times [2019-02-18 09:43:05,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:43:05,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:05,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:43:05,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:05,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:43:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:43:06,053 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:43:06,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:06,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:43:06,054 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:43:06,054 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:06,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:06,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:43:06,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:43:06,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:43:06,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:43:06,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:43:06,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:43:06,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:43:06,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,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, 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:43:06,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,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 23 treesize of output 37 [2019-02-18 09:43:06,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:43:06,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,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:43:06,093 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:06,120 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:06,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:06,145 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:06,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:06,172 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:06,172 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-18 09:43:06,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:43:06,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:06,250 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:06,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:43:06,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,287 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:06,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-02-18 09:43:06,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:06,330 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:06,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-18 09:43:06,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-02-18 09:43:06,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:06,420 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:06,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-18 09:43:06,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:06,464 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:06,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, 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 106 [2019-02-18 09:43:06,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:06,513 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:06,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:43:06,539 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:43:06,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:43:06,600 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:43:06,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:43:06,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:43:06,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:43:06,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:43:06,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:43:06,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:43:06,619 INFO L87 Difference]: Start difference. First operand 229 states and 1136 transitions. Second operand 12 states. [2019-02-18 09:43:09,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:43:09,326 INFO L93 Difference]: Finished difference Result 256 states and 1217 transitions. [2019-02-18 09:43:09,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:43:09,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-18 09:43:09,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:43:09,328 INFO L225 Difference]: With dead ends: 256 [2019-02-18 09:43:09,328 INFO L226 Difference]: Without dead ends: 249 [2019-02-18 09:43:09,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:43:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-02-18 09:43:11,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 227. [2019-02-18 09:43:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-02-18 09:43:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1126 transitions. [2019-02-18 09:43:11,385 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1126 transitions. Word has length 9 [2019-02-18 09:43:11,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:43:11,385 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1126 transitions. [2019-02-18 09:43:11,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:43:11,385 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1126 transitions. [2019-02-18 09:43:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 09:43:11,386 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:43:11,386 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:43:11,386 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:43:11,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:43:11,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1119435674, now seen corresponding path program 2 times [2019-02-18 09:43:11,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:43:11,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:11,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:43:11,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:11,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:43:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:43:11,509 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:43:11,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:11,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:43:11,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:43:11,509 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:11,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:11,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:43:11,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:43:11,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:43:11,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:43:11,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:43:11,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:43:11,528 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:43:11,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:43:11,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:43:11,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,549 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:43:11,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:43:11,560 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:11,579 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:11,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:11,596 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:11,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:11,620 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:11,621 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-18 09:43:11,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,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, 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:43:11,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:11,705 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:11,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:43:11,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,727 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:43:11,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:11,756 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:11,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:43:11,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,781 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:11,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-18 09:43:11,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:11,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:11,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-02-18 09:43:11,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:11,845 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 89 [2019-02-18 09:43:11,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:11,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:11,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:32 [2019-02-18 09:43:11,904 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:43:11,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:43:11,949 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:43:11,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:43:11,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-18 09:43:11,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:43:11,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:43:11,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:43:11,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:43:11,968 INFO L87 Difference]: Start difference. First operand 227 states and 1126 transitions. Second operand 11 states. [2019-02-18 09:43:14,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:43:14,388 INFO L93 Difference]: Finished difference Result 234 states and 1146 transitions. [2019-02-18 09:43:14,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:43:14,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-02-18 09:43:14,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:43:14,390 INFO L225 Difference]: With dead ends: 234 [2019-02-18 09:43:14,390 INFO L226 Difference]: Without dead ends: 207 [2019-02-18 09:43:14,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:43:14,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-18 09:43:14,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 51. [2019-02-18 09:43:14,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-18 09:43:14,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 224 transitions. [2019-02-18 09:43:14,852 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 224 transitions. Word has length 10 [2019-02-18 09:43:14,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:43:14,852 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 224 transitions. [2019-02-18 09:43:14,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:43:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 224 transitions. [2019-02-18 09:43:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 09:43:14,852 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:43:14,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:43:14,853 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:43:14,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:43:14,853 INFO L82 PathProgramCache]: Analyzing trace with hash -905277736, now seen corresponding path program 1 times [2019-02-18 09:43:14,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:43:14,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:14,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:43:14,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:14,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:43:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:43:15,111 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,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:15,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:43:15,111 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-18 09:43:15,112 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [28], [29] [2019-02-18 09:43:15,112 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:43:15,112 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:43:15,114 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:43:15,114 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 09:43:15,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:43:15,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:43:15,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:15,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:43:15,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:43:15,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:43:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:43:15,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:43:15,129 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:43:15,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:43:15,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 09:43:15,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,152 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:43:15,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,160 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,161 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,185 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,199 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,210 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,219 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,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,237 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:43:15,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:43:15,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,315 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,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:43:15,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,354 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:15,354 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:43:15,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,398 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,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:43:15,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 09:43:15,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,486 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,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 09:43:15,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,530 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:15,531 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 99 [2019-02-18 09:43:15,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,585 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,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-18 09:43:15,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:15,625 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43: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 40 treesize of output 96 [2019-02-18 09:43:15,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:15,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:15,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:43:15,700 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,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:43:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:43:15,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:43:15,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-18 09:43:15,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:43:15,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:43:15,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:43:15,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:43:15,813 INFO L87 Difference]: Start difference. First operand 51 states and 224 transitions. Second operand 14 states. [2019-02-18 09:43:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:43:17,119 INFO L93 Difference]: Finished difference Result 76 states and 322 transitions. [2019-02-18 09:43:17,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:43:17,120 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-02-18 09:43:17,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:43:17,120 INFO L225 Difference]: With dead ends: 76 [2019-02-18 09:43:17,120 INFO L226 Difference]: Without dead ends: 69 [2019-02-18 09:43:17,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2019-02-18 09:43:17,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-18 09:43:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2019-02-18 09:43:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-18 09:43:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 239 transitions. [2019-02-18 09:43:17,622 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 239 transitions. Word has length 10 [2019-02-18 09:43:17,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:43:17,622 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 239 transitions. [2019-02-18 09:43:17,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:43:17,623 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 239 transitions. [2019-02-18 09:43:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 09:43:17,623 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:43:17,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:43:17,623 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:43:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:43:17,623 INFO L82 PathProgramCache]: Analyzing trace with hash -62458648, now seen corresponding path program 2 times [2019-02-18 09:43:17,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:43:17,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:17,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:43:17,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:17,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:43:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:43:17,928 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 24 [2019-02-18 09:43:18,058 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:18,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:18,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:43:18,059 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:43:18,059 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:18,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:18,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:43:18,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:43:18,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:43:18,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-18 09:43:18,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:43:18,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:43:18,078 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:43:18,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,081 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:43:18,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,087 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:43:18,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,092 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:43:18,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:18,098 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,125 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,149 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,176 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:43:18,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,214 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:43:18,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,255 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:18,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:43:18,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,295 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:43:18,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,339 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:18,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:43:18,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,379 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:18,380 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 99 [2019-02-18 09:43:18,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,445 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:18,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-18 09:43:18,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,484 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:18,485 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:18,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,531 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:18,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-18 09:43:18,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,572 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:18,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:18,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,615 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:18,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:43:18,644 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:18,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:43:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:43:18,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:43:18,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-18 09:43:18,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:43:18,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:43:18,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:43:18,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:43:18,739 INFO L87 Difference]: Start difference. First operand 54 states and 239 transitions. Second operand 13 states. [2019-02-18 09:43:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:43:20,036 INFO L93 Difference]: Finished difference Result 75 states and 318 transitions. [2019-02-18 09:43:20,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:43:20,037 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-18 09:43:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:43:20,037 INFO L225 Difference]: With dead ends: 75 [2019-02-18 09:43:20,037 INFO L226 Difference]: Without dead ends: 68 [2019-02-18 09:43:20,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:43:20,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-18 09:43:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2019-02-18 09:43:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-18 09:43:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 206 transitions. [2019-02-18 09:43:20,508 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 206 transitions. Word has length 10 [2019-02-18 09:43:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:43:20,508 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 206 transitions. [2019-02-18 09:43:20,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:43:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 206 transitions. [2019-02-18 09:43:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 09:43:20,508 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:43:20,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:43:20,509 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:43:20,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:43:20,509 INFO L82 PathProgramCache]: Analyzing trace with hash -127091828, now seen corresponding path program 3 times [2019-02-18 09:43:20,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:43:20,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:20,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:43:20,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:20,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:43:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:43:20,763 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:20,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:20,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:43:20,764 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:43:20,764 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:20,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:20,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:43:20,771 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:43:20,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:43:20,776 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:43:20,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:43:20,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:43:20,779 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:43:20,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:43:20,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,788 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:43:20,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:43:20,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:20,803 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:20,829 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:20,843 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:20,854 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:20,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:20,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:20,881 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:43:20,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,917 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:43:20,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:20,959 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:20,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:43:20,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:20,999 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:43:21,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:21,045 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:21,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-18 09:43:21,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,088 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:21,089 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 99 [2019-02-18 09:43:21,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:21,139 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:21,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-18 09:43:21,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,178 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:21,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:21,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:21,225 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:21,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-18 09:43:21,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:21,271 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:21,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:21,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:21,319 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:21,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:43:21,346 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:21,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:43:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:43:21,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:43:21,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-18 09:43:21,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:43:21,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:43:21,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:43:21,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:43:21,439 INFO L87 Difference]: Start difference. First operand 47 states and 206 transitions. Second operand 14 states. [2019-02-18 09:43:23,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:43:23,180 INFO L93 Difference]: Finished difference Result 97 states and 409 transitions. [2019-02-18 09:43:23,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:43:23,181 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-02-18 09:43:23,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:43:23,181 INFO L225 Difference]: With dead ends: 97 [2019-02-18 09:43:23,181 INFO L226 Difference]: Without dead ends: 84 [2019-02-18 09:43:23,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:43:23,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-18 09:43:23,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-02-18 09:43:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-18 09:43:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 266 transitions. [2019-02-18 09:43:23,963 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 266 transitions. Word has length 10 [2019-02-18 09:43:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:43:23,963 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 266 transitions. [2019-02-18 09:43:23,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:43:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 266 transitions. [2019-02-18 09:43:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 09:43:23,963 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:43:23,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:43:23,963 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:43:23,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:43:23,964 INFO L82 PathProgramCache]: Analyzing trace with hash 230496124, now seen corresponding path program 4 times [2019-02-18 09:43:23,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:43:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:23,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:43:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:23,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:43:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:43:24,225 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:24,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:24,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:43:24,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:43:24,226 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:24,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:24,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:43:24,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:43:24,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:43:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:43:24,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:43:24,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 09:43:24,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,249 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:43:24,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,254 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:43:24,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,260 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:43:24,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,266 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:24,267 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:24,293 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:24,306 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:24,317 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:24,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:24,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:24,343 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-18 09:43:24,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 09:43:24,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:24,424 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:24,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-18 09:43:24,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,465 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:24,466 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:43:24,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:24,506 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:24,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2019-02-18 09:43:24,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-02-18 09:43:24,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:24,626 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:24,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-02-18 09:43:24,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,667 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:24,668 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:24,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:24,716 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:24,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-18 09:43:24,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:24,758 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:43:24,758 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:24,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:24,803 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:24,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 09:43:24,833 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:24,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:43:24,917 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:24,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:43:24,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-18 09:43:24,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:43:24,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:43:24,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:43:24,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:43:24,937 INFO L87 Difference]: Start difference. First operand 58 states and 266 transitions. Second operand 13 states. [2019-02-18 09:43:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:43:26,439 INFO L93 Difference]: Finished difference Result 67 states and 299 transitions. [2019-02-18 09:43:26,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:43:26,439 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-18 09:43:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:43:26,439 INFO L225 Difference]: With dead ends: 67 [2019-02-18 09:43:26,439 INFO L226 Difference]: Without dead ends: 0 [2019-02-18 09:43:26,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:43:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-18 09:43:26,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-18 09:43:26,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-18 09:43:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-18 09:43:26,441 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-02-18 09:43:26,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:43:26,441 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-18 09:43:26,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:43:26,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-18 09:43:26,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-18 09:43:26,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-18 09:43:26,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:26,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:26,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:26,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:27,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:27,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:27,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:27,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:28,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:29,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:29,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:29,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:29,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:29,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:29,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:29,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:33,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:34,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:35,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:39,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:39,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:39,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:41,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:41,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:45,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:45,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:45,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:45,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:45,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:45,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:45,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:45,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:46,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:46,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:46,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:46,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:46,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:48,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:58,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:59,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:59,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:59,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:59,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:43:59,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:04,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:16,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:23,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:24,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:24,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:24,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:31,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:31,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:32,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:32,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:32,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:32,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:40,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:40,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:43,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:43,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:43,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:43,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:43,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:43,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:44:49,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:45:29,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:45:42,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:45:43,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:45:43,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:46:00,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:46:00,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:46:00,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:46:06,859 WARN L181 SmtUtils]: Spent 2.67 m on a formula simplification. DAG size of input: 5253 DAG size of output: 4236 [2019-02-18 09:49:54,356 WARN L181 SmtUtils]: Spent 3.79 m on a formula simplification. DAG size of input: 3967 DAG size of output: 124 [2019-02-18 09:49:54,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-18 09:49:54,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 49) no Hoare annotation was computed. [2019-02-18 09:49:54,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 50) no Hoare annotation was computed. [2019-02-18 09:49:54,360 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-02-18 09:49:54,360 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-02-18 09:49:54,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2019-02-18 09:49:54,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONASSERT(line 52) no Hoare annotation was computed. [2019-02-18 09:49:54,361 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 48) no Hoare annotation was computed. [2019-02-18 09:49:54,361 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-18 09:49:54,361 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-02-18 09:49:54,361 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-02-18 09:49:54,361 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 54) no Hoare annotation was computed. [2019-02-18 09:49:54,361 INFO L444 ceAbstractionStarter]: At program point L41-1(lines 34 46) the Hoare annotation is: (let ((.cse14 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse0 (select |#memory_int| ULTIMATE.start_main_p5))) (let ((.cse26 (store |#memory_int| ULTIMATE.start_main_p5 (+ .cse0 1))) (.cse27 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse14 (- 1))))) (let ((.cse15 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse10 (select .cse27 ULTIMATE.start_main_p1)) (.cse25 (select .cse26 ULTIMATE.start_main_p4)) (.cse5 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2))) (.cse1 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse2 (= .cse5 0)) (.cse11 (= 0 .cse25)) (.cse16 (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p2))) (.cse13 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse6 (select .cse26 ULTIMATE.start_main_p2)) (.cse3 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5))) (.cse23 (= 0 .cse10)) (.cse17 (<= 0 .cse0)) (.cse9 (select .cse27 ULTIMATE.start_main_p3)) (.cse21 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (.cse8 (= 0 (select .cse27 ULTIMATE.start_main_p2))) (.cse12 (<= 1 (select .cse27 ULTIMATE.start_main_p5))) (.cse19 (= 0 (select .cse26 ULTIMATE.start_main_p1))) (.cse18 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse15 1))) (.cse7 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (or (and (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= .cse0 0) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse1 (- 1))) ULTIMATE.start_main_p1)) .cse2 .cse3 .cse4 (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse5 1)) ULTIMATE.start_main_p4) 1) 0) (<= .cse6 0)) .cse7) (and (and .cse8 (and (= 0 .cse9) (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 0 .cse10)))) .cse11 .cse12 .cse13 .cse4) (and (= 0 .cse0) (= .cse14 0) (<= .cse1 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) .cse2 (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (<= 0 .cse15) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (and (and (and (and (and (and .cse16 .cse17) (= 0 (select .cse18 ULTIMATE.start_main_p2)) .cse19) (<= 1 .cse5)) .cse11) (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p2))) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (and (<= .cse14 0) (<= 0 .cse9) (and (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) .cse17 (let ((.cse20 (<= 1 .cse10)) (.cse22 (<= (+ .cse6 1) 0))) (or (and .cse20 .cse8 .cse21 .cse16) (and .cse22 .cse20) (and .cse3 .cse22 .cse23 .cse13))))) (let ((.cse24 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))) (or (and (and (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) .cse3 .cse8 .cse24 .cse23) .cse17) (<= 1 .cse9)) (<= (+ .cse25 1) 0)) (and (and .cse21 .cse8 .cse12 .cse24 .cse19 (<= (+ (select .cse18 ULTIMATE.start_main_p4) 1) 0)) (= 0 (select .cse26 ULTIMATE.start_main_p3)) .cse7)))))))) [2019-02-18 09:49:54,380 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 09:49:54 BoogieIcfgContainer [2019-02-18 09:49:54,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-18 09:49:54,381 INFO L168 Benchmark]: Toolchain (without parser) took 688703.00 ms. Allocated memory was 138.4 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 105.9 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2019-02-18 09:49:54,381 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 138.4 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-18 09:49:54,381 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.68 ms. Allocated memory is still 138.4 MB. Free memory was 105.7 MB in the beginning and 103.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-02-18 09:49:54,381 INFO L168 Benchmark]: Boogie Preprocessor took 23.79 ms. Allocated memory is still 138.4 MB. Free memory was 103.3 MB in the beginning and 102.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-18 09:49:54,382 INFO L168 Benchmark]: RCFGBuilder took 416.02 ms. Allocated memory is still 138.4 MB. Free memory was 102.2 MB in the beginning and 91.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-02-18 09:49:54,382 INFO L168 Benchmark]: TraceAbstraction took 688205.60 ms. Allocated memory was 138.4 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 90.9 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2019-02-18 09:49:54,383 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 138.4 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.68 ms. Allocated memory is still 138.4 MB. Free memory was 105.7 MB in the beginning and 103.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.79 ms. Allocated memory is still 138.4 MB. Free memory was 103.3 MB in the beginning and 102.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 416.02 ms. Allocated memory is still 138.4 MB. Free memory was 102.2 MB in the beginning and 91.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 688205.60 ms. Allocated memory was 138.4 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 90.9 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 52]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((((!(p3 == p5) && #memory_int[p5] == 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p3] == 0) && !(p1 == p5)) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) && #memory_int[p5 := #memory_int[p5] + 1][p2] <= 0) && !(p3 == p1)) || (((((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p3] && !(p1 == p2) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p1 == p3)) && !(p3 == p2))) || ((((((((0 == #memory_int[p5] && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p3 < p4) && #memory_int[p3] == 0) && p2 < p3) && 0 <= #memory_int[p1]) && p4 < p5) && p1 < p2)) || (((((((!(p5 == p2) && 0 <= #memory_int[p5]) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && 1 <= #memory_int[p3]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && !(p4 == p2)) && !(p1 == p4))) || ((#memory_int[p4] <= 0 && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && (!(p5 == p4) && 0 <= #memory_int[p5]) && (((((1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && !(p5 == p2)) || (#memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0 && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1])) || (((!(p1 == p5) && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3))))) || (((((((!(p2 == p5) && !(p1 == p5)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p1)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 <= #memory_int[p5]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p5 := #memory_int[p5] + 1][p4] + 1 <= 0) || (((((((!(p2 == p3) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p2 == p1)) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p3]) && !(p3 == p1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 5 error locations. SAFE Result, 688.1s OverallTime, 146 OverallIterations, 2 TraceHistogramMax, 138.2s AutomataDifference, 0.0s DeadEndRemovalTime, 387.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 710 SDtfs, 3208 SDslu, 1 SDs, 0 SdLazy, 36534 SolverSat, 1932 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 50.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2696 GetRequests, 573 SyntacticMatches, 121 SemanticMatches, 2002 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8683 ImplicationChecksByTransitivity, 58.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 104 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 59.6s AutomataMinimizationTime, 146 MinimizatonAttempts, 5533 StatesRemovedByMinimization, 142 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 77 NumberOfFragments, 517 HoareAnnotationTreeSize, 1 FomulaSimplifications, 6385741493603791 FormulaSimplificationTreeSizeReduction, 160.4s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1235314563251 FormulaSimplificationTreeSizeReductionInter, 227.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 95.2s InterpolantComputationTime, 1929 NumberOfCodeBlocks, 1929 NumberOfCodeBlocksAsserted, 345 NumberOfCheckSat, 2455 ConstructedInterpolants, 768 QuantifiedInterpolants, 388476 SizeOfPredicates, 568 NumberOfNonLiveVariables, 3796 ConjunctsInSsa, 1211 ConjunctsInUnsatCore, 430 InterpolantComputations, 9 PerfectInterpolantSequences, 487/2868 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (1)] Forcibly destroying the process Received shutdown request...